IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i4p585-601.html
   My bibliography  Save this article

Operations and Shipment Scheduling of a Batch on a Felxible Machine

Author

Listed:
  • Seyed M. R. Iravani

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

  • John A. Buzacott

    (Schulich School of Business, York University, Toronto, Ontario, Canada M3J IP3)

  • Morton J. M. Posner

    (Department of Industrial Engineering and Management, Jerusalem College of Technology, Jerusalem, Israel)

Abstract

We consider processing and shipment scheduling of a batch of size M jobs on a flexible (multifunctional) machine. All jobs in the batch require the same sequence of N operations on the machine. Costs are incurred in the forms of holding costs of jobs waiting for the next operation, setup costs whenever the machine is set up for a new operation, and shipment cost whenever the whole batch or a part of it is shipped to the customer. Using a dynamic programming formulation of the problem, we first show how the problem size increases in M and N . Then, by focusing on the properties of some classes of batch-splitting policies, a heuristic algorithm is presented that generates suboptimal policies. Some numerical results are provided which show that the algorithm performs very well.

Suggested Citation

  • Seyed M. R. Iravani & John A. Buzacott & Morton J. M. Posner, 2003. "Operations and Shipment Scheduling of a Batch on a Felxible Machine," Operations Research, INFORMS, vol. 51(4), pages 585-601, August.
    • Handle: RePEc:inm:oropre:v:51:y:2003:i:4:p:585-601
    DOI: 10.1287/opre.51.4.585.16095
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.4.585.16095
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.51.4.585.16095?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
    ---><---

    References listed on IDEAS

    as
    1. I. Benkherouf & K. D. Glazebrook & R. W. Owen, 1994. "Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment," Operations Research, INFORMS, vol. 42(6), pages 1087-1099, December.
    2. Izak Duenyas & Diwakar Gupta & Tava Lennon Olsen, 1998. "Control of a Single-Server Tandem Queueing System with Setups," Operations Research, INFORMS, vol. 46(2), pages 218-230, April.
    3. K. D. Glazebrook, 1995. "A suboptimality bound for permutation policies in single machine stochastic scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 993-1005, September.
    4. Jeffrey B. Sidney, 1975. "Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs," Operations Research, INFORMS, vol. 23(2), pages 283-298, April.
    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. Maria Mayorga & Kevin Taaffe & Ramesh Arumugam, 2009. "Allocating flexible servers in serial systems with switching costs," Annals of Operations Research, Springer, vol. 172(1), pages 231-242, November.
    2. Jingui Xie & Yiming Fan & Mabel C. Chou, 2017. "Flexibility design in loss and queueing systems: efficiency of k-chain configuration," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 286-308, June.

    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. Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
    2. Ramesh Arumugam & Maria Mayorga & Kevin Taaffe, 2009. "Inventory based allocation policies for flexible servers in serial systems," Annals of Operations Research, Springer, vol. 172(1), pages 1-23, November.
    3. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2010. "Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 563-582, September.
    4. Herbert Hamers & Flip Klijn & Bas van Velzen, 2002. "On Games corresponding to Sequencing Situations with Precedence Relations," UFAE and IAE Working Papers 553.02, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    5. P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
    6. Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.
    7. Herbert Hamers & Flip Klijn & Bas Velzen, 2005. "On the Convexity of Precedence Sequencing Games," Annals of Operations Research, Springer, vol. 137(1), pages 161-175, July.
    8. K. D. Glazebrook & R. W. Owen, 1995. "Gittins‐index heuristics for research planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1041-1062, October.
    9. Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023. "An Allocation Rule for Graph Machine Scheduling Problems," Other publications TiSEM 17013f33-1d65-4294-802c-b, Tilburg University, School of Economics and Management.
    10. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2022. "Dynamic Control of Non‐Collaborative Workers When Reassignment Is Costly," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1332-1352, March.
    11. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    12. Peng Wang & Kai Pan & Zhenzhen Yan & Yun Fong Lim, 2022. "Managing Stochastic Bucket Brigades on Discrete Work Stations," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 358-373, January.
    13. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2012. "Flexible Servers in Understaffed Tandem Lines," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 761-777, July.
    14. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    15. Christoph Ambühl & Monaldo Mastrolilli & Nikolaus Mutsanas & Ola Svensson, 2011. "On the Approximability of Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 653-669, November.
    16. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    17. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2019. "Precedence theorems and dynamic programming for the single-machine weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 43-49.
    18. Gregory Dobson & Hsiao-Hui Lee & Arvind Sainathan & Vera Tilson, 2012. "A Queueing Model to Evaluate the Impact of Patient "Batching" on Throughput and Flow Time in a Medical Teaching Facility," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 584-599, October.
    19. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
    20. Dimitrios Pandelis, 2007. "Optimal use of excess capacity in two interconnected queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 179-192, February.

    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:inm:oropre:v:51:y:2003:i:4:p:585-601. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.