Planning production on a single processor with sequence-dependent setups. Part 2: Campaign sequencing and scheduling

Computers and Chemical Engineering

Volumn 25, Issue 7-8, 2001, Pages 1031-1043

  Oh, Hong Choon ^a   Karimi, I A ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Production planning; Scheduling; Sequencing; Tabu search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; LINEAR PROGRAMMING; PLANNING; PROCESS CONTROL; SCHEDULING;

SEQUENCE-DEPENDENT SETUPS;

PRODUCTION ENGINEERING;

COMPUTER AIDED PROCESS PLANNING;

ALGORITHM; ARTICLE; CALCULATION; CHEMICAL ENGINEERING; MATHEMATICAL ANALYSIS; METHODOLOGY; PLANNING;

EID: 0035882048     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(01)00677-9     Document Type: Article

References (14)

1. A tabu search experience in production scheduling
2. A dynamic programming approach to a lot size scheduling problem
3. The economic lot scheduling problem: Achieving feasibility using time-varying lot sizes
4. The cyclic lot scheduling problem with sequence-dependent setups
5. The application of marginal analysis to the economic lot scheduling problem
6. A user's guide to tabu search
7. An improved extended basic period procedure for solving the economic lot scheduling problem
8. Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times
9. Rounding off to powers of two in continuous relaxations of capacitated lot scheduling problems
10. Production scheduling with sequence dependent setup costs