IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p439-47210.1023-a1018946810121.html
   My bibliography  Save this article

An analysis of heuristics for the parallel-machine flexible-resource scheduling problem

Author

Listed:
  • Richard Daniels
  • Barbara Hoopes
  • Joseph Mazzola

Abstract

We consider the parallel-machine flexible-resource scheduling (PMFRS) problem in which a set of jobs must be scheduled over a set of parallel machines, where the processing time of each job is a function of the amount of allocated resource. Resource flexibility provides the capability to dynamically reassign a renewable resource across machines to break processing bottlenecks and improve system performance as measured by schedule makespan. The PMFRS problem has many important applications, including production scheduling of manufacturing cells where a cross-trained work force can be dynamically reallocated among cells. The problem is also NP-hard, motivating the development of effective heuristics that approximately determine the allocation of resource to jobs, the sequence of jobs on each machine, and the associated job start times that minimize system makespan. This paper explores heuristics for the PMFRS problem, and in particular the application of tabu-search methodology to this problem setting. We review an existing heuristic (SBH), define two tabu-search heuristics, and discuss extensive computational experience with the procedures. The computational results indicate that the heuristics are effective in obtaining approximate solutions to the PMFRS problem. In particular, the approach that uses tabu-search methodology in tandem with SBH consistently yields high-quality solutions with modest computational effort. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Richard Daniels & Barbara Hoopes & Joseph Mazzola, 1997. "An analysis of heuristics for the parallel-machine flexible-resource scheduling problem," Annals of Operations Research, Springer, vol. 70(0), pages 439-472, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:439-472:10.1023/a:1018946810121
    DOI: 10.1023/A:1018946810121
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018946810121
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018946810121?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.

    Citations

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


    Cited by:

    1. Cameron MacKenzie & Hiba Baroud & Kash Barker, 2016. "Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill," Annals of Operations Research, Springer, vol. 236(1), pages 103-129, January.
    2. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    3. George Vairaktarakis & Joseph G. Szmerekovsky & Jiayan Xu, 2016. "Level workforce planning for multistage transfer lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(7), pages 577-590, October.
    4. Cameron A. MacKenzie & Hiba Baroud & Kash Barker, 2016. "Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill," Annals of Operations Research, Springer, vol. 236(1), pages 103-129, January.
    5. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    6. Zhi Pei & Mingzhong Wan & Ziteng Wang, 2020. "A new approximation algorithm for unrelated parallel machine scheduling with release dates," Annals of Operations Research, Springer, vol. 285(1), pages 397-425, February.
    7. George Vairaktarakis & Janice Kim Winch, 1999. "Worker Cross-Training in Paced Assembly Lines," Manufacturing & Service Operations Management, INFORMS, vol. 1(2), pages 112-131.
    8. Richard L. Daniels & Joseph B. Mazzola & Dailun Shi, 2004. "Flow Shop Scheduling with Partial Resource Flexibility," Management Science, INFORMS, vol. 50(5), pages 658-669, May.

    More about this item

    Statistics

    Access and download statistics

    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:annopr:v:70:y:1997:i:0:p:439-472:10.1023/a:1018946810121. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.