Journal of Scheduling

, Volume 16, Issue 2, pp 161–183 | Cite as

A linear programming-based method for job shop scheduling

Article

Abstract

We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach.

Keywords

Job shop Shifting bottleneck Intermediate inventory holding costs Non-regular objective Optimal timing problem Linear programming Sensitivity analysis Single machine Earliness/tardiness 

References

  1. Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391–401. CrossRefGoogle Scholar
  2. Asadathorn, N. (1997). Scheduling of assembly type of manufacturing systems: algorithms and systems developments. PhD thesis, Department of Industrial Engineering, New Jersey Institute of Technology, Newark, NJ. Google Scholar
  3. Avci, S., & Storer, R. (2004). Compact local search neighborhoods for generalized scheduling. Working paper. Google Scholar
  4. Bulbul, K. (2002). Just-in-time scheduling with inventory holding costs. PhD thesis, University of California at Berkeley. Google Scholar
  5. Bulbul, K. (2011). A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Computers & Operations Research, 38(6), 967–983. http://dx.doi.org/10.1016/j.cor.2010.09.015 CrossRefGoogle Scholar
  6. Bulbul, K., Kaminsky, P., & Yano, C. (2004). Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Research Logistics, 51(3), 407–445. CrossRefGoogle Scholar
  7. Bulbul, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling, 10(4–5), 271–292. CrossRefGoogle Scholar
  8. Chang, S.-C., & Liao, D.-Y. (1994). Scheduling flexible flow shops with no setup effects. IEEE Transactions on Robotics and Automation, 10(2), 112–122. CrossRefGoogle Scholar
  9. Chang, Y. L., Sueyoshi, T., & Sullivan, R. (1996). Ranking dispatching rules by data envelopment analysis in a jobshop environment. IIE Transactions, 28(8), 631–642. Google Scholar
  10. Demirkol, E., Mehta, S., & Uzsoy, R. (1997). A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3(2), 111–137. CrossRefGoogle Scholar
  11. Dyer, M., & Wolsey, L. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26(2–3), 255–270. CrossRefGoogle Scholar
  12. Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326. CrossRefGoogle Scholar
  13. Jayamohan, M., & Rajendran, C. (2004). Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operations Research, 157(2), 307–321. CrossRefGoogle Scholar
  14. Kaskavelis, C., & Caramanis, M. (1998). Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE Transactions, 30(11), 1085–1097. Google Scholar
  15. Kedad-Sidhoum, S., & Sourd, F. (2010). Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Computers & Operations Research, 37(8), 1464–1471. CrossRefGoogle Scholar
  16. Kreipl, S. (2000). A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3(3), 125–138. CrossRefGoogle Scholar
  17. Kutanoglu, E., & Sabuncuoglu, I. (1999). An analysis of heuristics in a dynamic job shop with weighted tardiness objectives. International Journal of Production Research, 37(1), 165–187. CrossRefGoogle Scholar
  18. Laha, D. (2007). Heuristics and metaheuristics for solving scheduling problems. In D. Laha & P. Mandal (Eds.), Handbook of Computational Intelligence in Manufacturing and Production Management (Chap. 1, pp. 1–18). Hershey: Idea Group. CrossRefGoogle Scholar
  19. LEKIN®-Flexible Job-Shop Scheduling System (2002). Version 2.4. http://www.stern.nyu.edu/om/software/lekin/index.htm.
  20. Lenstra, J., Rinnooy Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362. CrossRefGoogle Scholar
  21. Mason, S., Fowler, J., & Carlyle, W. (2002). A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5(3), 247–262. CrossRefGoogle Scholar
  22. Ohta, H., & Nakatanieng, T. (2006). A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs. International Journal of Production Economics, 101(1), 19–29. CrossRefGoogle Scholar
  23. Ovacik, I. M., & Uzsoy, R. (1996). Decomposition methods for complex factory scheduling problems. Berlin: Springer. Google Scholar
  24. Park, M.-W., & Kim, Y.-D. (2000). A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints. European Journal of Operations Research, 123(3), 504–518. CrossRefGoogle Scholar
  25. Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46(1), 1–17. CrossRefGoogle Scholar
  26. Singer, M. (2001). Decomposition methods for large job shops. Computers & Operations Research, 28(3), 193–207. CrossRefGoogle Scholar
  27. Sourd, F. (2009). New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS Journal on Computing, 21(1), 167–175. CrossRefGoogle Scholar
  28. Tanaka, S., & Fujikuma, S. (2008). An efficient exact algorithm for general single-machine scheduling with machine idle time. In IEEE international conference on automation science and engineering, 2008. CASE 2008 (pp. 371–376). CrossRefGoogle Scholar
  29. Thiagarajan, S., & Rajendran, C. (2005). Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Computers and Industrial Engineering, 49(4), 463–503. CrossRefGoogle Scholar
  30. Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035–1047. CrossRefGoogle Scholar
  31. Xhafa, F., & Abraham, A. (Eds.) (2008). Studies in computational intelligence: Vol. 128. Metaheuristics for scheduling in industrial and manufacturing applications. Berlin: Springer. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Manufacturing Systems and Industrial EngineeringSabancı UniversityIstanbulTurkey
  2. 2.Industrial Engineering and Operations ResearchUniversity of California, BerkeleyBerkeleyUSA

Personalised recommendations