Batching decisions for assembly production systems

European Journal of Operational Research

Volumn 157, Issue 3, 2004, Pages 620-642

  Kovalyov, M Y ^a,b   Potts, C N ^c   Strusevich, V A ^d  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

^c UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^d UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Assembly scheduling problem; Batch availability; Batching; Complexity; Flow shop

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION MAKING; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; PRODUCTION ENGINEERING; SCHEDULING;

ASSEMBLY SCHEDULING PROBLEMS; BATCHING DECISIONS; FLOW SHOP; TWO-STAGE ASSEMBLY MODELS;

OPERATIONS RESEARCH;

EID: 2342574240     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00250-9     Document Type: Article

References (14)

1. Brucker P., Gladky A.A., Hoogeveen J.A., Kovalyov M.Y., Potts C.N., Tautenhahn T., van de Velde S.L. Scheduling a batching machine. Journal of Scheduling. 1:1998;31-54.
2. Cheng T.C.E., Wang G. Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Transactions. 30:1998;447-453.
3. Coffman E.G. Jr., Yannakakis M., Magazine M.J., Santos C. Batch sizing and job sequencing on a single machine. Annals of Operations Research. 26:1990;135-147.
4. Glass C.A., Potts C.N., Strusevich V.A. Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing. 13:2001;120-137.
5. Graham R.E., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. 5:1979;287-326.
6. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61-68.
7. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Handbooks in Operations Research and Management Science. Logistics of Production and Inventory. vol. 4:1993;455-522 North-Holland, Amsterdam.
8. Lee C.-Y., Cheng T.C.E., Lin B.M.T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science. 39:1993;616-625.
9. Lee C.-Y., Uzsoy R., Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research. 40:1992;764-775.
10. Potts C.N., Kovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research. 120:2000;228-249.
11. Potts C.N., Sevast'janov S.V., Strusevich V.A., Van Wassenhove L.N., Zwaneveld C.M. The two-stage assembly scheduling problem: Complexity and approximation. Operations Research. 43:1995;346-355.
12. Potts C.N., Strusevich V.A., Tautenhahn T. Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling. 4:2001;25-51.
13. Tang L., Liu J., Rong A., Yang Z. A review of planning and scheduling systems and methods for integrated steel production. European Journal of Operational Research. 133:2001;1-20.
14. Webster S.T., Baker K.R. Scheduling groups of jobs on a single machine. Operations Research. 43:1995;692-703.