One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective

Optimization Methods and Software

Volumn 19, Issue 2, 2004, Pages 165-178

  Baki, Mohammed Fazle ^a   Vickson, R G ^b  

^a UNIVERSITY OF WINDSOR   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational complexity; One operator; Pseudopolynomial algorithm; Scheduling; Two machine

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

ONE-OPERATOR; PSEUDOPOLYNOMIAL ALGORITHMS; TWO-MACHINE;

DYNAMIC PROGRAMMING;

EID: 1842764955     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780410001657653     Document Type: Article

References (18)

1. S. French (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Horwood, Chichester.
2. M.F. Baki (1999). Some Problems in One-Operator Scheduling. PhD Thesis, Department of Management Sciences, University of Waterloo.
3. M.F. Baki and R.G. Vickson (2003). One-operator, two-machine open shop and flow shop scheduling with setup times for machines and maximum lateness objective. INFOR (to appear).
4. E.J. Lee and P.B. Mirchandini (1988). Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell. IEEE Journal of Robotics and Automation, 4(3), 256-264.
5. D.D. Bedworth and J.E. Bailey. (1987). Integrated Production Control Systems: Management, Analysis, Design, 2nd ed. Wiley, New York.
6. F.M. Julien and M.J. Magazine (1990). Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management, 3, 177-199.
7. A.E. Gerodimos, C.A. Glass, C.N. Potts, and T. Tautenhahn (1999). Scheduling multi-operation jobs on a single machine. Annals of Operations Research, 92, 87-105.
8. K.R. Baker (1988). Scheduling the production of components at a common facility. IIE Transactions, 20, 32-35.
9. A.E. Gerodimos, C.A. Glass and C.N. Potts (1999). Scheduling the production of two-component jobs on a single machine. European Journal of Operational Research, 120, 250-259.
10. C. Santos and M.J. Magazine (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99-103.
11. R.G. Vickson, M.J. Magazine and C.A. Santos (1993). Batching and sequencing of components at a single facility. IIE Transactions, 25, 65-70.
12. C.S. Sung and C.K. Park (1993). Scheduling of products with common and product-dependents components manufactured at a single facility. Journal of the Operational Research Society, 44(8), 773-784.
13. S.T. Webster and K.R. Baker (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692-703.
14. C.N. Potts and M.Y. Kovalyov (1999). Scheduling with batching: a review. European Journal of Operational Research, 120, 228-249.
15. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn and S.L. Van de Velde (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31-54.
16. D.S. Hochbaum and D. Landy (1994). Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79-86.
17. P. Brucker and M.Y. Kovalyov (1996). Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research, 43, 1-8.
18. N.G. Hall and M.E. Posner (2001). Generating experimental data for machine scheduling problems. Operations Research, 49, 854-865.