Skip to main content
Log in

Relocation scheduling subject to fixed processing sequences

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

This study addresses a relocation scheduling problem that corresponds to resource-constrained scheduling on two parallel dedicated machines where the processing sequences of jobs assigned to the machines are given and fixed. Subject to the resource constraints, the problem is to determine the starting times of all jobs for each of the six considered regular performance measures, namely, the makespan, total weighted completion time, maximum lateness, total weighted tardiness, weighted number of tardy jobs, and number of tardy jobs. By virtue of the proposed dynamic programming framework, the studied problem for the minimization of makespan, total weighted completion time, or maximum lateness can be solved in \(O(n_1n_2(n_1+n_2))\) time, where \(n_1\) and \(n_2\) are the numbers of jobs on the two machines. The simplified case with a common job processing time can be solved in \(O(n_1n_2)\) time. For the objective function of total weighted tardiness or weighted number of tardy jobs, this problem is proved to be NP-hard in the ordinary sense, and the case with a common job processing length is solvable in \(O(n_1n_2\min \{n_1,n_2\})\) time. The studied problem for the minimization of number of tardy jobs is solvable in \(O(n^2_1n^2_2(n_1+n_2)^2)\) time. The solvability of the common-processing-time problems can be generalized to the m-machine cases, where \(m\ge 3\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Amir, A., & Kaplan, E. H. (1988). Relocation problems are hard. International Journal of Computer Mathematics, 25(2), 101–110.

    Article  Google Scholar 

  • Briskorn, D., Choi, B.-C., Lee, K., Leung, J., & Pinedo, M. (2010). Complexity of single machine scheduling subject to nonnegative inventory constraints. European Journal of Operational Research, 207(2), 605–619.

    Article  Google Scholar 

  • Cheng, T. C. E., Lin, B. M. T., & Toker, A. (2000). Makespan minimization in the two-machine flowshop batch scheduling problem. Naval Research Logistics, 47(2), 128–144.

    Article  Google Scholar 

  • Hwang, F. J., Kovalyov, M. Y., & Lin, B. M. T. (2012). Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discrete Optimization, 9(1), 29–39.

    Article  Google Scholar 

  • Hwang, F. J., Kovalyov, M. Y., & Lin, B. M. T. (2014). Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263–279.

    Article  Google Scholar 

  • Hwang, F. J., & Lin, B. M. T. (2011). Coupled-task scheduling on a single machine subject to a fixed job sequence. Computer & Industrial Engineering, 60(4), 690–698.

    Article  Google Scholar 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.

    Article  Google Scholar 

  • Kaplan, E. H. (1986). Relocation models for public housing redevelopment programs. Environment and Planning B: Planning and Design, 13(1), 5–19.

    Article  Google Scholar 

  • Kaplan, E. H., & Amir, A. (1988). A fast feasibility test for relocation problems. European Journal of Operational Research, 35(2), 201–206.

    Article  Google Scholar 

  • Kaplan, E. H., & Berman, O. (1988). OR hits the heights: Relocation planning at the orient heights housing project. Interfaces, 18(6), 14–22.

    Article  Google Scholar 

  • Kononov, A. V., & Lin, B. M. T. (2006). On relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366–381.

    Article  Google Scholar 

  • Kononov, A. V., & Lin, B. M. T. (2010). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123–129.

    Article  Google Scholar 

  • Laborie, P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence, 143(2), 151–188.

    Article  Google Scholar 

  • Lin, B. M. T., & Cheng, T. C. E. (2006). Two-machine flowshop scheduling with conditional deteriorating second operations. International Transactions in Operational Research, 13(2), 91–98.

    Article  Google Scholar 

  • Lin, B. M. T., & Hwang, F. J. (2011). Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type. Information Processing Letters, 111(5), 208–212.

    Article  Google Scholar 

  • Neumann, K., & Schwindt, C. (2002). Project scheduling with inventory constraints. Mathematical Methods of Operations Research, 56(3), 513–533.

    Article  Google Scholar 

  • Ng, C. T., & Kovalyov, M. Y. (2007). Batching and scheduling in a multi-machine flow shop. Journal of Scheduling, 10(6), 353–364.

    Article  Google Scholar 

  • Shafransky, Y. M., & Strusevich, V. A. (1998). The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics, 45(7), 705–731.

    Article  Google Scholar 

Download references

Acknowledgments

The authors are grateful to the anonymous reviewers for their constructive comments that have improved earlier versions of this paper. Lin was supported in part by the Ministry of Science and Technology of Taiwan under Grants NSC-97-2923-H-009-001-MY3 and NSC-102-2923-H-009-001-MY3. Kononov was partially supported by the Russian Foundation of Humanities under Grant RFH-NSC-13-02-10002.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bertrand M. T. Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, B.M.T., Hwang, F.J. & Kononov, A.V. Relocation scheduling subject to fixed processing sequences. J Sched 19, 153–163 (2016). https://doi.org/10.1007/s10951-015-0455-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-015-0455-8

Keywords

Navigation