Advanced Search
MyIDEAS: Login to save this article or follow this journal

A survey of scheduling problems with late work criteria

Contents:

Author Info

  • Sterna, Malgorzata
Registered author(s):

    Abstract

    The paper presents the first complete survey of scheduling problems with the late work criteria. Late work objective functions estimate the quality of a schedule based on durations of late parts of jobs, not taking into account the amount of delay for fully late jobs. The paper provides a formal definition of the late work parameter and compares the criteria based on it with other classical performance measures. It shows the relationship between the late work model and the imprecise computation model known from the hard real-time literature. Moreover, the paper presents a few real world applications of the late work objective function. The paper lists results obtained for nearly forty problems of scheduling jobs on a single machine, parallel (identical and uniform) machines and dedicated machines, investigated in the literature since 1984.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VC4-509W7DD-1/2/14e80843dd2b25a57d5dbb530b456b88
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Omega.

    Volume (Year): 39 (2011)
    Issue (Month): 2 (April)
    Pages: 120-129

    as in new window
    Handle: RePEc:eee:jomega:v:39:y:2011:i:2:p:120-129

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=375&ref=375_01_ooc_1&version=01

    Related research

    Keywords: Scheduling Late work Single machine Parallel machines Dedicated machines;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Janiak, Adam & Rudek, RadosLaw, 2010. "A note on a makespan minimization problem with a multi-ability learning effect," Omega, Elsevier, vol. 38(3-4), pages 213-217, June.
    2. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "Complexity results for scheduling chains on a single machine," European Journal of Operational Research, Elsevier, vol. 4(4), pages 270-275, April.
    3. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    4. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    5. Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.
    6. Blazewicz, Jacek & Pesch, Erwin & Sterna, Malgorzata & Werner, Frank, 2005. "The two-machine flow-shop problem with weighted late work criterion and common due date," European Journal of Operational Research, Elsevier, vol. 165(2), pages 408-415, September.
    7. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    8. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    9. Almiñana, M. & Escudero, L.F. & Landete, M. & Monge, J.F. & Rabasa, A. & Sánchez-Soriano, J., 2010. "WISCHE: A DSS for water irrigation scheduling," Omega, Elsevier, vol. 38(6), pages 492-500, December.
    10. Fagerholt, Kjetil & Christiansen, Marielle & Magnus Hvattum, Lars & Johnsen, Trond A.V. & Vabø, Thor J., 2010. "A decision support methodology for strategic planning in maritime transportation," Omega, Elsevier, vol. 38(6), pages 465-474, December.
    11. Rad, Shahriar Farahmand & Ruiz, Rubén & Boroojerdian, Naser, 2009. "New high performing heuristics for minimizing makespan in permutation flowshops," Omega, Elsevier, vol. 37(2), pages 331-345, April.
    12. Jianfeng Ren & Yuzhong Zhang & Guo Sun, 2009. "The Np-Hardness Of Minimizing The Total Late Work On An Unbounded Batch Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(03), pages 351-363.
    13. Sun Lee, Ik & Yoon, S.H., 2010. "Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs," Omega, Elsevier, vol. 38(6), pages 509-521, December.
    14. Carlier, J. & Pinson, E., 1994. "Adjustment of heads and tails for the job-shop problem," European Journal of Operational Research, Elsevier, vol. 78(2), pages 146-161, October.
    15. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    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 in new window

    Cited by:
    1. Lai, Peng-Jen & Lee, Wen-Chiung, 2011. "Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects," Omega, Elsevier, vol. 39(5), pages 467-471, October.
    2. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    3. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:39:y:2011:i:2:p:120-129. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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