Skip to main content
Log in

Approximation algorithms for inventory constrained scheduling on a single machine

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider the problem of scheduling a set of jobs on a single machine subject to inventory constraints, i.e., conditions that jobs add or remove items to or from a centralized inventory, respectively. Jobs that remove items cannot be processed if the required number of items is not available. We focus on scheduling problems on a single machine where the objective is to minimize the total weighted completion time. In this paper, we design 2-approximation algorithms for special cases of the problem that run in polynomial time.

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

Similar content being viewed by others

References

  • Bartels, J.-H., & Zimmermann, J. (2009). Scheduling tests in automotive R&D projects. European Journal of Operational Research, 193(3), 805–819.

    Article  Google Scholar 

  • Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook on scheduling. Berlin: Springer.

    Google Scholar 

  • Boysen, N. (2010). Truck scheduling at zero-inventory crossdocking terminals. Computers and Operations Research, 37, 32–41.

    Article  Google Scholar 

  • Boysen, N., & Fliedner, M. (2010). Cross dock scheduling: Classification, literature review and research agenda. Omega, 38, 413–422.

    Article  Google Scholar 

  • Boysen, N., Fliedner, M., & Scholl, A. (2010). Scheduling inbound and outbound trucks at cross docking terminals. OR Spectrum, 32, 135–161.

    Article  Google Scholar 

  • Briskorn, D., Jaehn, F., & Pesch, E. (2013). Exact algorithms for inventory constrained scheduling on a single machine. Journal of Scheduling, 16, 105–115.

    Article  Google Scholar 

  • Briskorn, D., & Leung, J. (2013). Minimizing maximum lateness of jobs in inventory constrained scheduling. Journal of the Operational Research Society, 64, 1851–1864.

    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 

  • Chen, F., & Lee, C.-Y. (2009). Minimizing the makespan in a two-machine cross-docking flow shop problem. European Journal of Operational Research, 193, 5972.

    Google Scholar 

  • Chen, F., & Song, K. (2009). Minimizing makespan in two-stage hybrid cross docking scheduling problem. Computers and Operations Research, 36, 2066–2073.

    Article  Google Scholar 

  • Chen, J.-S. (2008). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190, 90–102.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimisation and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 22.1–22.13). Boca Raton, FL: CRC Press.

    Google Scholar 

  • McWilliams, D. L., Stanfield, P. M., & Geiger, C. D. (2005). The parcel hub scheduling problem: A simulation-based solution approach. Computers and Industrial Engineering, 49, 393–412.

    Article  Google Scholar 

  • Miao, Z., Lim, A., & Ma, H. (2009). Truck dock assignment with operational time constraint within crossdocks. European Journal of Operational Research, 192(1), 105–115.

    Article  Google Scholar 

  • Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers and Operations Research, 36, 2541–2545.

    Article  Google Scholar 

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

  • Neumann, K., Schwindt, C., & Trautmann, N. (2005). Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. European Journal of Operational Research, 165, 495–509.

    Article  Google Scholar 

  • Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems. Berlin: Springer.

    Google Scholar 

  • Schwindt, C., & Trautmann, N. (2000). Batch scheduling in process industries: An application of resource-constrained project scheduling. OR-Spektrum, 22(4), 501–524.

    Article  Google Scholar 

  • Sun, K., & Li, H. (2010). Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. International Journal of Production Economics, 124, 151–158.

    Article  Google Scholar 

  • Yu, W., & Egbelu, P. J. (2008). Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. European Journal of Operational Research, 184, 377–396.

    Article  Google Scholar 

  • Zhao, C.-L., & Tang, H.-Y. (2010). Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Applied Mathematical Modelling, 34, 837–841.

    Article  Google Scholar 

Download references

Acknowledgments

E.  Morsy has been supported by the Alexander von Humboldt Stiftung, E. Pesch has been supported by the German Science Foundation (DFG) through the grant ”Optimierung der Containerabfertigung in Umschlagbahnhöfen” (PE 514/16-1,2), as well as the Grant ”Scheduling mechanisms for rail mounted gantries with regard to crane interdependencies” (PE 514/22-1).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ehab Morsy.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Morsy, E., Pesch, E. Approximation algorithms for inventory constrained scheduling on a single machine. J Sched 18, 645–653 (2015). https://doi.org/10.1007/s10951-015-0433-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-015-0433-1

Keywords

Navigation