A note on flow-shop and job-shop batch scheduling with identical processing-time jobs

European Journal of Operational Research

Volumn 161, Issue 1, 2005, Pages 285-291

  Mosheiov, Gur ^a   Oron, Daniel ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Batch scheduling; Flow shop; Job shop; Makespan

Indexed keywords

DECISION MAKING; FUNCTIONS; GRAPH THEORY; JOB ANALYSIS; OPERATIONS RESEARCH; POLYNOMIALS;

BATCH SCHEDULING; FLOW-SHOPS; JOB-SHOPS; MAKESPAN;

SCHEDULING;

EID: 5144221177     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.09.010     Document Type: Conference Paper

References (5)

1. Cheng T.C.E., Lin B.M.T., Toker A. Makespan minimization in the two-machine flowshop batch scheduling problem. Naval Research Logistics. 47:2000;128-144.
2. C.T. Ng, M.Y. Kovalyov, Batching and scheduling in a multi-machine flow-shop, in submission.
3. Potts C.N., Kovalyov M. Scheduling with batching: A review. European Journal of Operational Research. 120:2000;228-249.
4. Pinedo M. Scheduling: Theory, Algorithms and Systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
5. Lenstra J.K., Rinnooy Kan A.R.K. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics. 4:1979;121-140.