IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i6d10.1007_s10951-016-0497-6.html
   My bibliography  Save this article

Single machine scheduling with a generalized job-dependent cumulative effect

Author

Listed:
  • Kabir Rustogi

    (University of Greenwich)

  • Vitaly A. Strusevich

    (University of Greenwich)

Abstract

We consider a single machine scheduling problem with changing processing times. The processing conditions are subject to a general cumulative effect, in which the processing time of a job depends on the sum of certain parameters associated with previously scheduled jobs. In previous papers, these parameters are assumed to be equal to the normal processing times of jobs, which seriously limits the practical application of this model. We further generalize this model by allowing every job to respond differently to these cumulative effects. For the introduced model, we solve the problem of minimizing the makespan, with and without precedence constraints. For the problem without precedence constraints, we also consider a situation in which a maintenance activity is included in the schedule, which can improve the processing conditions of the machine, not necessarily to its original state. The resulting problem is reformulated as a variant of a Boolean programming problem with a quadratic objective, known as a half-product, which allows us to develop a fully polynomial-time approximation scheme with the best possible running time.

Suggested Citation

  • Kabir Rustogi & Vitaly A. Strusevich, 2017. "Single machine scheduling with a generalized job-dependent cumulative effect," Journal of Scheduling, Springer, vol. 20(6), pages 583-592, December.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:6:d:10.1007_s10951-016-0497-6
    DOI: 10.1007/s10951-016-0497-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-016-0497-6
    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-016-0497-6?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. 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.
    2. W-H Kuo & D-L Yang, 2008. "Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 416-420, March.
    3. Kuo, Wen-Hung & Yang, Dar-Li, 2006. "Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1184-1190, October.
    4. Clyde L. Monma & Jeffrey B. Sidney, 1979. "Sequencing with Series-Parallel Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 215-224, August.
    5. Lee, C. -Y. & Leon, V. J., 2001. "Machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 128(1), pages 119-128, January.
    6. T. Badics & E. Boros, 1998. "Minimization of Half-Products," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 649-660, August.
    7. Lee, Chung-Yee & Lin, Chen-Sin, 2001. "Single-machine scheduling with maintenance and repair rate-modifying activities," European Journal of Operational Research, Elsevier, vol. 135(3), pages 493-513, December.
    8. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    9. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Simple matching vs linear assignment in scheduling models with positional effects: A critical review," European Journal of Operational Research, Elsevier, vol. 222(3), pages 393-407.
    10. Kabir Rustogi & Vitaly A Strusevich, 2015. "Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(3), pages 500-515, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shi-Sheng Li & Ren-Xia Chen & Qi Feng & Cheng-Wen Jiao, 2019. "Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 957-971, October.
    2. Norelhouda Sekkal & Fayçal Belkaid, 2020. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 660-696, October.
    3. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.

    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. Alan J. Soper & Vitaly A. Strusevich, 2020. "Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects," Journal of Scheduling, Springer, vol. 23(6), pages 665-680, December.
    2. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    3. Finke, Gerd & Gara-Ali, Ahmed & Espinouse, Marie-Laure & Jost, Vincent & Moncel, Julien, 2017. "Unified matrix approach to solve production-maintenance problems on a single machine," Omega, Elsevier, vol. 66(PA), pages 140-146.
    4. Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu, 2023. "Optimization of scheduling problems with deterioration effects and an optional maintenance activity," Journal of Scheduling, Springer, vol. 26(3), pages 251-266, June.
    5. 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.
    6. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    7. Shi-Sheng Li & Ren-Xia Chen, 2017. "Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(02), pages 1-17, April.
    8. Wang, Ting & Baldacci, Roberto & Lim, Andrew & Hu, Qian, 2018. "A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine," European Journal of Operational Research, Elsevier, vol. 271(3), pages 826-838.
    9. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    10. Mosheiov, Gur & Sarig, Assaf & Strusevich, Vitaly A & Mosheiff, Jonathan, 2018. "Two-machine flow shop and open shop scheduling problems with a single maintenance window," European Journal of Operational Research, Elsevier, vol. 271(2), pages 388-400.
    11. Du-Juan Wang & Yunqiang Yin & Mengqi Liu, 2016. "Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3691-3705, June.
    12. Gur Mosheiov & Daniel Oron, 2020. "Scheduling problems with a weight-modifying-activity," Annals of Operations Research, Springer, vol. 295(2), pages 737-745, December.
    13. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    14. Anna Arigliano & Gianpaolo Ghiani & Antonio Grieco & Emanuela Guerriero, 2017. "Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs," 4OR, Springer, vol. 15(2), pages 201-215, June.
    15. Shi-Sheng Li & Ren-Xia Chen & Qi Feng & Cheng-Wen Jiao, 2019. "Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 957-971, October.
    16. 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.
    17. G Mosheiov & J B Sidney, 2010. "Scheduling a deteriorating maintenance activity on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 882-887, May.
    18. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    19. Delorme, Maxence & Iori, Manuel & Mendes, Nilson F.M., 2021. "Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events," European Journal of Operational Research, Elsevier, vol. 295(3), pages 823-837.
    20. Halman, Nir & Kellerer, Hans & Strusevich, Vitaly A., 2018. "Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints," European Journal of Operational Research, Elsevier, vol. 270(2), pages 435-447.

    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:20:y:2017:i:6:d:10.1007_s10951-016-0497-6. 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.