IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i4d10.1007_s10951-017-0543-z.html
   My bibliography  Save this article

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time

Author

Listed:
  • Zhijun Xu

    (East China University of Technology
    Tongji University)

  • Dehua Xu

    (East China University of Technology
    Nanjing University of Finance & Economics)

Abstract

We consider a single-machine tool change scheduling problem where tool change durations are workload-dependent. The processing times of all the jobs are the same. The objective is to determine the number of tool change activities, the start time and the completion time of each tool change activity jointly and schedule all the jobs to the machine such that the total completion time of the jobs is minimized. For the case where the tool change duration function is concave, we present a linear time optimal algorithm. For the case where the tool change duration function is convex, we convert it into a convex integer quadratic programming problem with fixed dimension and then propose two polynomial time algorithms for it. We also study some special cases for which optimal schedules can be obtained directly. For the case where the tool change duration function is linear, we present all the optimal schedules.

Suggested Citation

  • Zhijun Xu & Dehua Xu, 2018. "Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time," Journal of Scheduling, Springer, vol. 21(4), pages 461-482, August.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:4:d:10.1007_s10951-017-0543-z
    DOI: 10.1007/s10951-017-0543-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0543-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-017-0543-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    2. Subhash C. Sarin & Divya Prakash, 2004. "Equal Processing Time Bicriteria Scheduling on Parallel Machines," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 227-240, September.
    3. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    4. Akturk, M. Selim & Ghosh, Jay B. & Gunes, Evrim D., 2004. "Scheduling with tool changes to minimize total completion time: Basic results and SPT performance," European Journal of Operational Research, Elsevier, vol. 157(3), pages 784-790, September.
    5. Mosheiov, Gur & Yovel, Uri, 2006. "Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs," European Journal of Operational Research, Elsevier, vol. 172(2), pages 528-544, July.
    6. Peter Brucker & Natalia V. Shakhlevich, 2016. "Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines," Journal of Scheduling, Springer, vol. 19(6), pages 659-685, December.
    7. X Qi & T Chen & F Tu, 1999. "Scheduling the maintenance on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1071-1078, October.
    8. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    9. Oron, Daniel & Shabtay, Dvir & Steiner, George, 2015. "Single machine scheduling with two competing agents and equal job processing times," European Journal of Operational Research, Elsevier, vol. 244(1), pages 86-99.
    10. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    11. Chen, Jen-Shiang, 2008. "Optimization models for the tool change scheduling problem," Omega, Elsevier, vol. 36(5), pages 888-894, October.
    12. Gerstl, Enrique & Mosheiov, Gur, 2013. "Due-window assignment with identical jobs on parallel uniform machines," European Journal of Operational Research, Elsevier, vol. 229(1), pages 41-47.
    13. Xu, Dehua & Liu, Min & Yin, Yunqiang & Hao, Jinghua, 2013. "Scheduling tool changes and special jobs on a single machine to minimize makespan," Omega, Elsevier, vol. 41(2), pages 299-304.
    14. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    2. Jing Fan & Xiwen Lu, 2015. "Supply chain scheduling problem in the hospital with periodic working time on a single machine," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 892-905, November.
    3. Xu, Dehua & Liu, Min & Yin, Yunqiang & Hao, Jinghua, 2013. "Scheduling tool changes and special jobs on a single machine to minimize makespan," Omega, Elsevier, vol. 41(2), pages 299-304.
    4. Patiño Rodriguez, Carmen Elena & Francisco Martha de Souza, Gilberto, 2010. "Reliability concepts applied to cutting tool change time," Reliability Engineering and System Safety, Elsevier, vol. 95(8), pages 866-873.
    5. J S Chen, 2006. "Single-machine scheduling with flexible and periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 703-710, June.
    6. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    7. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    8. Sun, Kaibiao & Li, Hongxing, 2010. "Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 124(1), pages 151-158, March.
    9. Gerstl, Enrique & Mosheiov, Gur, 2013. "Due-window assignment with identical jobs on parallel uniform machines," European Journal of Operational Research, Elsevier, vol. 229(1), pages 41-47.
    10. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Single machine scheduling with general positional deterioration and rate-modifying maintenance," Omega, Elsevier, vol. 40(6), pages 791-804.
    11. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    12. Qiulan Zhao & Jinjiang Yuan, 2020. "Bicriteria scheduling of equal length jobs on uniform parallel machines," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 637-661, April.
    13. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    14. Chen, Jen-Shiang, 2008. "Optimization models for the tool change scheduling problem," Omega, Elsevier, vol. 36(5), pages 888-894, October.
    15. Hermelin, Danny & Kubitza, Judith-Madeleine & Shabtay, Dvir & Talmon, Nimrod & Woeginger, Gerhard J., 2019. "Scheduling two agents on a single machine: A parameterized analysis of NP-hard problems," Omega, Elsevier, vol. 83(C), pages 275-286.
    16. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    17. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    18. Xiao, Lei & Zhang, Xinghui & Tang, Junxuan & Zhou, Yaqin, 2020. "Joint optimization of opportunistic maintenance and production scheduling considering batch production mode and varying operational conditions," Reliability Engineering and System Safety, Elsevier, vol. 202(C).
    19. Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
    20. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:21:y:2018:i:4:d:10.1007_s10951-017-0543-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.