Skip to main content
SpringerLink
Log in

Parallel machine scheduling with multiple unloading servers

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We study a parallel machine scheduling problem with multiple unloading servers. After a machine completes processing one job, an unloading server is needed to remove the job from the machine. Only after unloading, the machine is available for processing the next job. The model is motivated by the milk run operations of a logistics company that faces limited unloading docks at the warehouse. Our interest is to minimize the total completion time of the jobs. We show that the shortest-processing-time-first (SPT) algorithm has a worst-case bound of 2. We also develop other improved heuristic algorithms as well as a branch-and-bound algorithm to solve the problem. Computational experiments show that our algorithms are efficient and effective.

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

Access this article

Log in via an institution

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

  • Abdekhodaee, A. H., & Wirth, A. (2002). Scheduling parallel machines with a single server: some solvable cases and heuristics. Computers & Operations Research, 29, 295–315.

    Article  Google Scholar 

  • Abdekhodaee, A. H., Wirth, A., & Gan, H. S. (2004). Equal processing and equal setup time cases of scheduling parallel machines with a single server. Computers & Operations Research, 31, 1867–1889.

    Article  Google Scholar 

  • Abdekhodaee, A. H., Wirth, A., & Gan, H. S. (2006). Scheduling two parallel machines with a single server: the general case. Computers & Operations Research, 33, 994–1009.

    Article  Google Scholar 

  • Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S.A., & Werner, F. (2002). Complexity results for parallel machine problems with a single server. Journal of Scheduling, 5, 429–457.

    Article  Google Scholar 

  • Brucker, P., Knust, S., & Wang, G. (2005). Complexity results for flow-shop problems with a single server. European Journal of Operational Research, 165, 398–407.

    Article  Google Scholar 

  • Cheng, T. C. E., Wang, G., & Sriskandarajah, C. (1999). One-operator-two-machine flowshop scheduling with setup and dismounting times. Computers & Operations Research, 26, 715–730.

    Article  Google Scholar 

  • Dawande, M., Geismar, H. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling, 8, 387–426.

    Article  Google Scholar 

  • Glass, C. A., Shafransky, Y. M., & Strusevich, V. A. (2000). Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47, 304–328.

    Article  Google Scholar 

  • Hall, N. G., Potts, C. N., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102, 23–243.

    Article  Google Scholar 

  • Koulamas, C. P. (1996). Scheduling two parallel semiautomatic machines to minimize machine interference. Computers & Operations Research, 23, 945–956.

    Article  Google Scholar 

  • Kravchenko, S. A., & Werner, F. (1997). Parallel machine scheduling problems with a single server. Mathematical and Computer Modelling, 26, 1–11.

    Article  Google Scholar 

  • Kravchenko, S. A., & Werner, F. (1998). Scheduling on parallel machines with servers. Otto-von-Guericke University, preprint 30/98.

  • Kravchenko, S. A., & Werner, F. (2001). A heuristic for minimizing flow time with unit setups. Information Processing Letters, 79, 291–296.

    Article  Google Scholar 

  • Lee, C.-Y. (1991). Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics, 30, 53–61.

    Article  Google Scholar 

  • Lee, C.-Y., He, Y., & Tang, G. (2000). A note on parallel machine scheduling with non-simultaneous machine available time. Discrete Applied Mathematics, 100, 133–135.

    Article  Google Scholar 

  • Lim, A., Rodrigues, B., & Wang, C. (2006). Two-machine flow shop problems with a single server. Journal of Scheduling, 9, 515–543.

    Article  Google Scholar 

  • Sriskandarajah, C., Drobouchevitch, I., Sethi, S. P., & Chandrasekaran, R. (2004). Scheduling multiple parts in a robotic cell served by a dual-gripper robot. Operations Research, 52, 65–82.

    Article  Google Scholar 

  • Wang, G., & Cheng, T. C. E. (2001). An approximation algorithm for parallel machine scheduling with a common server. Journal of Operational Research Society, 52, 234–237.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Administrative Management, Jinan University, Guangzhou, China

    Jinwen Ou

  2. Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong

    Xiangtong Qi & Chung-Yee Lee

Authors
  1. Jinwen Ou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangtong Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chung-Yee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiangtong Qi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ou, J., Qi, X. & Lee, CY. Parallel machine scheduling with multiple unloading servers. J Sched 13, 213–226 (2010). https://doi.org/10.1007/s10951-009-0104-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-009-0104-1

Keywords

Search

Navigation