Machine scheduling with job class setup and delivery considerations

Computers and Operations Research

Volumn 37, Issue 6, 2010, Pages 1123-1128

  Cheng, T C E ^a   Wang, Xiuli ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Algorithms; Job class setup; Machine scheduling; Transportation

Indexed keywords

ARRIVAL TIME; BATCH SIZES; DELIVERY VEHICLE; DYNAMIC PROGRAMMING ALGORITHM; JOB CLASS SETUPS; MACHINE SCHEDULING; MACHINE SCHEDULING PROBLEM; PARALLEL MACHINE; PERFORMANCE BOUNDS; PROCESSING JOBS; SET-UP TIME; SINGLE MACHINES; TRANSPORT COSTS; WEIGHTED SUM;

CUSTOMER SATISFACTION; MACHINERY; SALES; SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

PROBLEM SOLVING;

EID: 71749108491     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.10.001     Document Type: Article

References (18)

1. Lee C.-Y., and Chen Z.-L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
2. Chen Z.-L., and Variraktarakis G.L. Integrated scheduling of production and distribution operations. Management Science 51 (2005) 614-628
3. Chen Z.-L., and Pundoor G. Order assignment and scheduling in a supply chain. Operations Research 54 (2006) 555-572
4. Wang X.-L., and Cheng T.C.E. Machine scheduling with an availability constraint and job delivery coordination. Naval Research Logistics 54 (2007) 11-20
5. Dawande M., Geismar H.N., Hall N.G., and Sriskandarajah C. Supply chain scheduling: distribution systems. Production and Operations Management 15 (2006) 243-261
6. Hurter A.P., and Van Buer M.G. The newspaper production/distribution problem. Journal of Business Logistics 17 (1996) 85-107
7. Monma C.L., and Potts C.N. On the complexity of scheduling with batch setup times. Operations Research 37 (1989) 798-804
8. Monma C.L., and Potts C.N. Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Operations Research 41 (1993) 981-993
9. Chen B., Ye Y.-Y., and Zhang J.-W. Lot-sizing scheduling with batch setup times. Journal of Scheduling 9 (2006) 299-310
10. Wang X.-L., and Cheng T.C.E. Two-machine flowshop scheduling with job class setups to minimize total flowtime. Computers and Operations Research 32 (2005) 2751-2770
11. Wang X.-L., and Cheng T.C.E. A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups. Computers and Operations Research 33 (2006) 1326-1344
12. Schaller J. Scheduling on a single machine with family setups to minimize total tardiness. International Journal of Production Economics 105 (2007) 329-344
13. Nong Q.-Q., Yuan J.-J., Fu R.-Y., Lin L., and Tian J. The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan. International Journal of Production Economics 111 (2008) 435-440
14. Potts C.N., and Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society 43 (1992) 395-406
15. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. European Journal of Operational Research 120 (2000) 228-249
16. Pinedo M. Scheduling: theory, algorithm, and systems. 2nd ed (2002), Prentice-Hall, Upper Saddle River, NJ
17. Cheng T.C.E., Ng C.T., and Yuan J.J. The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. Journal of Scheduling 6 (2003) 483-490
18. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman, New York