Customer order scheduling on a single machine with family setup times: Complexity and algorithms

Applied Mathematics and Computation

Volumn 185, Issue 1, 2007, Pages 11-18

  Erel, Erdal ^a   Ghosh, Jay B ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b Apratech LLC   (United States)

Author keywords

Computational complexity; Dynamic programming; Machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; DYNAMIC PROGRAMMING; MACHINERY; MATHEMATICAL MODELS; POLYNOMIALS;

CUSTOMER ORDER SCHEDULING; MACHINE SCHEDULING; SCHEDULING PROBLEMS;

SCHEDULING;

EID: 33846910215     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.06.086     Document Type: Article

References (26)

1. R.H. Ahmadi, U. Bagchi, Coordinated Scheduling of Customer Orders, Working Paper, John E. Anderson Graduate School of Management, University of California, Los Angeles, 1994.
2. Bagchi U., Julien F.M., and Magazine M.J. Due-date assignment to multi-job customer orders. Management Science 40 (1994) 1389-1392
3. Baker K.R. Scheduling the production of components at a common facility. IIE Transactions 20 (1988) 32-35
4. Blocher J.D., and Chhajed D. The customer order lead-time problem on parallel machines. Naval Research Logistics 43 (1996) 629-654
5. Blocher J.D., Chhajed D., and Leung M. Customer order scheduling in a general job shop environment. Decision Sciences 29 (1998) 951-981
6. T.C.E. Cheng, G. Wang, Customer Order Scheduling on Multiple Facilities, Working Paper No. 11/98-9, Faculty of Business and Information Systems, The Hong Kong Polytechnic University, Hong Kong, 1999.
7. Coffman E.G., Nozari A., and Yannakakis M. Optimal scheduling of products with two subassemblies on a single machine. Operations Research 37 (1989) 426-436
8. Daganzo C.F. The crane scheduling problem. Transportation Research Part B 23 (1989) 159-175
9. E. Erel, J.B. Ghosh, The Customer Order Scheduling Problem Revisited, Discussion Paper No. 97-10, Faculty of Business Administration, Bilkent University, Ankara, Turkey, 1997.
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
11. Gerodimos A.E., Glass C.A., Potts C.N., and Tautenhahn T. Scheduling multi-operation jobs on a single machine. Annals of Operations Research 92 (1999) 87-105
12. V. Gondhalekar, R. Jain, J. Werth, Scheduling on Airdisks: Efficient Access to Personalized Information Services via Periodic Wireless Data Broadcast, Technical report No. CS-TR-96-25, Department of Computer Sciences, University of Texas, Austin, 1996.
13. J.N.D. Gupta, J.C. Ho, J.A.A. van der Veen, Single Machine Hierarchical Scheduling with Customer Orders and Multiple Job Classes, Working paper, The Netherlands Business School, Nijenrode University, The Netherlands, 1995.
14. Hastings N.A.J., and Yeh C.-H. Job oriented production scheduling. European Journal of Operational Research 47 (1990) 35-48
15. Held M., and Karp R.M. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10 (1962) 196-210
16. F.M. Julien, Scheduling Multi-Product Customer Orders: Heuristics and Lower Bounds, Working Paper 96-09, University of Ottawa, 1996.
17. Julien F.M., and Magazine M.J. Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management 3 (1990) 177-199
18. Kim Y.-D. A comparison of dispatching rules for job shops with multiple identical jobs and alternate routings. International Journal of Production Research 28 (1990) 953-962
19. Leung J.Y.-T., Li H., and Pinedo M. Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling 8 (2005) 355-386
20. Liao C.-J. Tradeoff between setup times and carrying costs for finished items. Computers & Operations Research 20 (1993) 697-705
21. Liao C.-J., and Chuang C.-H. Sequencing with setup time and order tardiness trade-offs. Naval Research Logistics 43 (1996) 971-984
22. Ng C.T., Cheng T.C.E., and Yuan J.J. Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling 6 (2003) 405-412
23. T.A. Roemer, R.H. Ahmadi, Complexity of Scheduling Customer Orders, Working Paper, John E. Anderson Graduate School of Management, University of California, Los Angeles, 1997.
24. Vickson R.G., Santos C.A., and Magazine M.J. Batching and sequencing components at a single facility. IIE Transactions 25 (1993) 65-70
25. Yang J. The complexity of customer order scheduling problems on parallel machines. Computers & Operations Research 32 (2005) 1921-1939
26. Yang J., and Posner M.E. Scheduling parallel machines for the customer order problem. Journal of Scheduling 8 (2005) 49-74