An MILP-based reordering algorithm for complex industrial scheduling and rescheduling

Computers and Chemical Engineering

Volumn 25, Issue 4-6, 2001, Pages 821-828

  Roslof J ^a   Harjunkoski, I ^a   Bjorkqvist J ^a   Karlsson, S ^a   Westerlund, T ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Heuristics; MILP; Paper converting industry; Scheduling; Sequence dependent setup times

Indexed keywords

ALGORITHMS; DRUG PRODUCTS PLANTS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; PAPER AND PULP MILLS; SYSTEMS ENGINEERING;

MIXED INTEGER LINEAR PROGRAMMING (MILP);

OPERATIONS RESEARCH;

ALGORITHM; CALCULATION; CONFERENCE PAPER; DRUG INDUSTRY; LINEAR SYSTEM; SYSTEM ANALYSIS; WORK SCHEDULE;

EID: 0035339890     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(01)00674-3     Document Type: Conference Paper

References (6)

1. A tabu search heuristic for the multi-processor scheduling problem with sequence dependent setup times
2. A branch-bound solution to the general scheduling problem
3. General reordering algorithm for scheduling of batch processes
4. A heuristic to minimize the total weighted tardiness with sequence-dependent setups
5. Continuous time representation in batch/semicontinuous process scheduling: Randomized heuristics approach
6. A short-term scheduling problem in the paper-converting industry