The customer order lead-time problem on parallel machines

Naval Research Logistics

Volumn 43, Issue 5, 1996, Pages 629-654

  Blocher, James D ^a   Chhajed, Dilip ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING;

CUSTOMER ORDER LEAD TIME; JOB COMPLETION TIME; LOWER BOUNDS; PARALLEL MACHINES;

OPERATIONS RESEARCH;

EID: 0030214445     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7     Document Type: Article

References (15)

1. Ahmadi, R.H., and Bagchi, U., "Coordinated Scheduling of Customer Orders," Working Paper, February 1993.
2. Baker, K.R., "Scheduling the Production of Components at a Common Facility," IIE Transaciions, 20, 32-35 (1988).
3. Blocher, J.D., and Chand, S., "Scheduling of Parallel Processors: A Posterior Bound on LPT Sequencing and a Two-Step Algorithm," Naval Research Logistics, 38, 273-287 (1991).
4. Blocher, J.D., and Chhajed, D., "The Customer Order Lead Time Problem on Parallel Machines," Office of Research Working Paper No. 94-0149, University of Illinois at Urbana-Champaign, 1994.
5. Bruno, J., Coffman, E.G., and Sethi, R., "Scheduling Independent Tasks to Reduce Mean Finishing Time," Communications of the ACM, 17, 382-387 (1974).
6. Coffman, E.G., Nozari, A., and Yannakakis, M., "Optimal Scheduling of Products with Two Subassemblies on a Single Machine," Operations Research, 37, 426-436 (1989).
7. Geoffrion, A.M., "Lagrangian Relaxation for Integer Programming," Mathematical Programming Study, 2, 82-114 (1974).
8. Golden, B.L., and Stewart. W.R., "Empirical Analysis of Heuristics," The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys, Eds., John Wiley & Sons, New York, 1985, Chap. 7.
9. Hastings, N.A.J., and Yeh, C.-H., "Job Oriented Production Scheduling," European Journal of Operational Research, 47, 35-48 (1990).
10. Julien, F.M., "Scheduling Multi-Job Customer Orders to Minimize Maximum Lateness," Working Paper No. 92-03, University of Ottawa, 1992.
11. Julien, P.M., "A General Framework for Five Single Machine Batching Models," Working Paper No. 92-04, University of Ottawa, 1992.
12. Julien, F.M., and Magazine, M.J., "Scheduling Customer Orders: An Alternative Production Scheduling Approach," Journal of Manufacturing and Operations Management, 3, 177-199 (1990).
13. Kirn, Y.-D., "A Comparison of Dispatching Rules for Job Shops with Multiple Identical Jobs and Alternate Routings," International Journal of Production Research, 28, 953-962 (1990).
14. Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., "Complexity of Machine Scheduling Problems," Annals of Discrete Mathematics, 1, 342-362 (1977).
15. Vickson, R.G., Santos, C.A., and Magazine, M.J., "Batching and Scheduling Components at a Single Facility," IIE Transactions, 25, 65-70 (1993).