Scheduling the production of two-component jobs on a single machine

European Journal of Operational Research

Volumn 120, Issue 2, 2000, Pages 250-259

  Gerodimos, Alex E ^a   Glass, Celia A ^a   Potts, Chris N ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; JUST IN TIME PRODUCTION; MATHEMATICAL MODELS; POLYNOMIALS; PRODUCTION ENGINEERING;

COMPONENT SCHEDULING; MAXIMUM LATENESS; PROCESSING TIME;

SCHEDULING;

EID: 0033906317     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00154-X     Document Type: Article

References (19)

1. Albers S., Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics. 47:1993;87-107.
2. Baker K.R. Scheduling the production of components at a common facility. IIE Transactions. 20:1988;32-35.
3. Blocher J.D., Chhajed D. The customer order lead-time problem on parallel machines. Naval Research Logistics. 43:1996;629-654.
4. Bruno J., Sethi R. Task sequencing in a batch environment with setup times. Foundations of Control Engineering. 3:1978;105-117.
5. Coffman Jr E.G., Nozari A., Yannakakis M. Optimal scheduling of products with two subassemblies on a single machine. Operations Research. 37:1989;426-436.
6. Coffman Jr E.G., Yannakakis M., Magazine M.J., Santos C. Batch sizing and job sequencing on a single machine. Annals of Operations Research. 26:1990;135-147.
7. R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
8. M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, CA, 1979.
9. A.E. Gerodimos, C.A. Glass, C.N. Potts, Scheduling the production of two-component jobs on a single machine, Preprint OR87, Faculty of Mathematical Studies, University of Southampton, Southampton, UK, 1997.
10. A.E. Gerodimos, C.A. Glass, C.N. Potts, T. Tautenhahn, Scheduling multi-operation jobs on a single machine, Annals of Operations Research (to appear).
11. Ghosh J.B. Batch scheduling to minimize total completion time. Operations Research Letters. 16:1994;271-275.
12. Ghosh J.B., Gupta J.N.D. Batch scheduling to minimize maximum lateness. Operations Research Letters. 21:1997;77-80.
13. Gupta J.N.D., Ho J.C., van der Veen J.A.A. Single machine hierarchical scheduling with customer orders and multiple job classes. Annals of Operations Research. 70:1997;127-143.
14. van Hoesel S., Wagelmans A., Moerman B. Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. European Journal of Operational Research. 75:1994;312-331.
15. F.M. Julien, The product scheduling problem under various availability constraints, INFOR (to appear).
16. Julien F.M., Magazine M.J. Scheduling customer orders: An alternative production scheduling approach. Journal of Manufacturing and Operations Management. 3:1990;177-199.
17. Moore J.M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15:1968;102-109.
18. Santos C.A., Magazine M.J. Batching in single operation manufacturing systems. Operations Research Letters. 4:1985;99-103.
19. Vickson R.G., Magazine M.J., Santos C.A. Batching and sequencing of components at a single facility. IIE Transactions. 25:1993;65-70.