Job scheduling with technical constraints

Journal of the Operational Research Society

Volumn 55, Issue 2, 2004, Pages 160-169

  Corry, P ^a   Kozan, E ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Meta heuristics; Push pull production; Scheduling

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

JOB-SHOP SCHEDULING; META-HEURISTICS; PUSH-PULL PRODUCTION; TECHNICAL CONSTRAINTS;

OPERATIONS RESEARCH;

EID: 2342580248     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601673     Document Type: Conference Paper

References (16)

1. Roy B and Sussman B (1964). Les problèmes d'ordonnancement avec constraints disjonctives. Note DS No 9, SEMA, Paris.
2. Ovacik IM and Uzsoy R (1994). Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. Int J Product Res 32: 1243-1263.
3. Ovacik IM and Uzsoy R (1994). Exploiting shop floor status information to schedule complex job shops. J Manuf Systems 13: 73-84.
4. Ramudhin A and Marier P (1996). The generalized shifting bottleneck procedure. Eur J Opl Res 93: 34-48.
5. Ivens P and Lembrecht M (1996). Extending the shifting bottleneck procedure to real-life applications. Eur J Opl Res 90: 252-268.
6. Garey MR and Johnson DS (eds) (1979). Computers and Intractability. W H Freeman and Co: San Fransisco.
7. Holthaus O and Rajendran C (1997). Efficient dispatching rules for scheduling in a job shop. Int J Product Econ 48: 87-105.
8. Lalsare P and Sen S (1995). Evaluating backward scheduling and sequencing rules for an assembly shop environment. Product Inventory Mngt J 36: 71-77.
9. Adams J, Balas E and Zawack D (1988). The shifting bottleneck procedure for job shop scheduling. Mngt Sci 34: 391-401.
10. Dauzere-Perex S and Lasserre JB (1993). A modified shifting bottleneck procedure for job-shop scheduling. Int J Product Res 31: 923-932.
11. van Laarhoven PJM, Aarts EL and Lenstra JK (1992). Job shop scheduling by simulated annealing. Opns Res 40: 113-125.
12. Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop problem. Mngt Sci 42: 797-813.
13. Candido MAB, Khator SK and Barcia RM (1998). A genetic algorithm based procedure for more realistic job shop scheduling problems. Int J Product Res 12: 3437-3457.
14. Armentano VA and Scrich CR (2000). Tabu search for minimizing total tardiness in a job shop. Int J Product Econ 63: 131-140.
15. Corry PG (2002). Improving efficiency in an iron foundry using meta-heuristics, PhD thesis, Queensland University of Technology.
16. Corry PG and Kozan E (2002). Optimising a horizontally integrated push/pull hybrid production system in a foundry. In: Kozan E and Ohuchi A (eds). Operations Research/Management Science at Work. Kluwer: Norwell, MA, pp 189-204.