IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Scheduling tool changes and special jobs on a single machine to minimize makespan

Listed author(s):
  • Xu, Dehua
  • Liu, Min
  • Yin, Yunqiang
  • Hao, Jinghua
Registered author(s):

    This paper considers a variation of the classical single machine scheduling problem with tool changes. In the variation, two sets of jobs, namely special jobs and normal jobs, are considered. By special jobs, we mean that each special job must be processed within the first prefixed time units of a tool life. To solve the scheduling problem with small size and moderate size, we propose two mathematical programming models. To solve the scheduling problem with large size, we propose three sets of algorithms and focus on the performance of six algorithms based on the studies of a new bin packing problem. Worst-case analysis is conducted. Numerical experiment shows that each of the six algorithms can solve instances with up to 5000 jobs in about 0.5s with an average relative error less than 4%.

    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:
    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.

    Article provided by Elsevier in its journal Omega.

    Volume (Year): 41 (2013)
    Issue (Month): 2 ()
    Pages: 299-304

    in new window

    Handle: RePEc:eee:jomega:v:41:y:2013:i:2:p:299-304
    DOI: 10.1016/
    Contact details of provider: Web page:

    Order Information: Postal:

    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.:

    in new window

    1. 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.
    2. Chen, Jen-Shiang, 2008. "Optimization models for the tool change scheduling problem," Omega, Elsevier, vol. 36(5), pages 888-894, October.
    3. 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.
    Full references (including those not matched with items on IDEAS)

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

    When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:41:y:2013:i:2:p:299-304. 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: (Dana Niculescu)

    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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.