A framework for machine scheduling problems with controllable processing times

Production and Operations Management

Volumn 5, Issue 4, 1996, Pages 391-405

  Alidaee, Bahram ^a   Kochenberger, Gary A ^a  

^a NONE

Author keywords

Applications of transportation problem; Controllable times; Single and multiple machine scheduling

Indexed keywords

EID: 0006183587     PISSN: 10591478     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1937-5956.1996.tb00407.x     Document Type: Article

References (37)

1. ADIRI, I. AND Z. YEHUDAI (1987), "Scheduling on Machines with Variable Service Rates," Computers & Operations Research, 14, 4, 289-297.
2. ALIDAEE, B. AND A. AHMADIAN (1993), "Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times," European Journal of Operational Research, 70, 3, 335-341.
3. BADIRU, A. B. (1988), Project Management in Manufacturing and High Technology Operations, John-Wiley & Sons, New York.
4. BAGCHI, U. (1989), "Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems," Operations Research, 37, 1, 118-125.
5. BAKER, K. R. (1974), Introduction to Sequencing and Scheduling, Wiley, New York.
6. CHENG, T. C., Z. L. CHEN, AND C-L. LI (1994), "Single-Machine Scheduling with Trade-Off Between Number of Tardy Jobs and Resource Allocation," Working Paper, Hong Kong University.
7. DANIELS, R. L. (1989), "Resource Allocation and Multi-Project Scheduling," in Advances in Project Scheduling, R. Slowinski and J. Weglarz, (ed.), Elsevier Science Publishers. Amsterdam, 87-112.
8. _ (1990), "A Multi-Objective Approach to Resource Allocation in Single Machine Scheduling," European Journal of Operational Research, 48, 226-241.
9. _ AND J. B. MAZZOLA (1994), "Flow Shop Scheduling with Resource Flexibility," Operations Research, 42, 3, 504-522.
10. _ AND R. K. SARIN (1989), "Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy." Operations Research, 37, 6, 981-984.
11. ELMAGHRABY, S. E. (1977), Activity Networks, Wiley, New York.
12. FLODES, S. AND F. SOUMIS (1993), "PERT and Crashing Revisited: Mathematical Generalization," European Journal of Operational Research, 64, 268-294.
13. GRABOWSKI, J. AND A. JANIAK (1986), "Job-Shop Scheduling with Resource-Time Models of Operations," European Journal of Operational Research, 28, 58-73.
14. IBARAKI, T. AND N. KATOH (1988), Resource Allocation Problems, The MIT Press, Cambridge, MA.
15. ISHII, H., C. MARTEL, T. MASUDA, AND T. NISHIDA (1985), "A Generalized Uniform Processor System," Operations Research, 33, 2, 346-362.
16. KANET, J. (1981a), "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, 27, 1453-1459.
17. _ (1981b), "Minimizing the Average Deviation of Completion Times About a Common Due Date," Naval Research Logistic Quarterly, 28, 4, 643-651.
18. KUBIAK, W. (1993), "Completion Time Variance Minimization on Single Machine is Difficult," Operations Research Letters, 14, 1, 49-60.
19. LAWRENCE, S. R. AND T. E. MORTON (1993), "Resource-Constrained Multi-Project Scheduling with Tardy Costs: Comparing Myopic, Bottleneck, and Resource Pricing Heuristics," European Journal of Operational Research, 64, 168-187.
20. LEE, IN-SOO (1991), "Single Machine Scheduling with Controllable Processing Times: A Parametric Study," International Journal of Production Economics, 22, 105-110.
21. MERTEN, A. G. AND M. E. MULLER (1972), "Variance Minimization in Single Machine Scheduling," Management Science, 18, 9, 518-528.
22. MODER, J. J. AND C. R. PHILLIPS (1970), Project Management with CPM and PERT, Van Nostrand Reinhold Company, New York.
23. NOWICKI, E. AND S. ZDRZALKA (1988), "A Two-Machine Flow Shop Scheduling Problem with Controllable Job Processing Times," European Journal of Operational Research, 34, 208-220.
24. _ AND S. ZDRZALKA (1990), "A Survey of Results for Sequencing Problems with Controllable Processing Times," Discrete Applied Mathematics, 26, 271-287.
25. PANWALKAR, S. S., R. A. DUDEK, AND M. L. SMITH (1973), "Sequencing Research and the Industrial Scheduling Problem," in Symposium on the Theory of Scheduling and its Applications, S. E. Elmaghraby, (ed.), Springer, New York.
26. _, M. SMITH, AND A. SEIDMANN (1982), "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, 30, 2, 391-399.
27. _ AND R. RAJAGOPALAN (1992a), "A Single Machine Sequencing Problem with Controllable Processing Times," European Journal of Operational Research, 59, 298-302.
28. _ AND R. RAJAGOPALAN (1992b), "Single Machine Sequencing Problem with a Convex Cost Function for Processing Cost," Technical Report, Texas Tech University.
29. PAPADIMITRIOU, C. H. AND STIEGLITZ. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall.
30. TADA, M., H. ISHII, AND T. NISHIDA (1989), "A Generalized Version of One Machine Maximum Lateness Problem," Journal of the Operational Research Society of Japan, 32, 383-388.
31. TRICK, M. A. (1994), "Scheduling Multiple Variable-Speed Machines," Operations Research, 42, 2, 234-248.
32. VAN WASSENHOVE, L. N. AND K. BAKER (1982), "A Bicriterion Approach to Time/Cost Trade-Offs in Sequencing," European Journal of Operational Research, 11, 48-54.
33. VEPSALAINEN, A. P. AND T. E. MORTON. (1987), "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, 33, 8, 1035-1047.
34. VICKSON, R. G. (1980a), "Two Single-Machine Sequencing Problem Involving Controllable Job Processing Times," AIIE Transactions, 12, 3, 258-262.
35. _ (1980b), "Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus flow Cost on a Single Machine," Operations Research, 28, 5, 1155-1167.
36. VIDAL, R. V. (1987), "A Simple Method to Solve Some Simple Allocation Problems," IIE Transactions, 19, 2, 234-237.
37. ZDRZALKA, S. (1991), "Scheduling Jobs on a Single Machine with Release Dates, Delivery Times and Controllable Processing Times: Worst-Case Analysis," Operations Research Letters, 10, 9, 519-524.