IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v51y1997i3p165-176.html
   My bibliography  Save this article

Scheduling families of jobs with setup times

Author

Listed:
  • Liaee, Mohammad Mehdi
  • Emmons, Hamilton

Abstract

No abstract is available for this item.

Suggested Citation

  • Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
    • Handle: RePEc:eee:proeco:v:51:y:1997:i:3:p:165-176
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(96)00105-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    2. N.D. Gupta, Jatinder, 1988. "Single facility scheduling with multiple job classes," European Journal of Operational Research, Elsevier, vol. 33(1), pages 42-45, January.
    3. Clyde L. Monma & Chris N. Potts, 1993. "Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 41(5), pages 981-993, October.
    4. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    5. Gregory Dobson & Uday S. Karmarkar & Jeffrey L. Rummel, 1987. "Batching to Minimize Flow Times on One Machine," Management Science, INFORMS, vol. 33(6), pages 784-799, June.
    6. T. C. E. Cheng & Z.-L. Chen, 1994. "Parallel Machine Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 42(6), pages 1171-1174, December.
    7. L. G. Mitten, 1959. "Sequencing n Jobs on Two Machines with Arbitrary Time Lags," Management Science, INFORMS, vol. 5(3), pages 293-298, April.
    8. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    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. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    2. Drótos, Márton & Erdos, Gábor & Kis, Tamás, 2009. "Computing lower and upper bounds for a large-scale industrial job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 296-306, August.
    3. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Nossack, Jenny & Pesch, Erwin, 2014. "Minimizing setup costs in a transfer line design problem with sequential operation processing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 186-194.
    4. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    5. Waldherr, Stefan & Knust, Sigrid, 2017. "Decomposition algorithms for synchronous flow shop problems with additional resources and setup times," European Journal of Operational Research, Elsevier, vol. 259(3), pages 847-863.
    6. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    7. Janiak, Adam & Kovalyov, Mikhail Y. & Portmann, Marie-Claude, 2005. "Single machine group scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 162(1), pages 112-121, April.
    8. Wang, Guoqing & Cheng, T. C. Edwin, 2000. "Parallel machine scheduling with batch delivery costs," International Journal of Production Economics, Elsevier, vol. 68(2), pages 177-183, November.
    9. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    10. W L Pearn & S H Chung & M H Yang & K P Shiao, 2008. "Solution strategies for multi-stage wafer probing scheduling problem with reentry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 637-651, May.
    11. Florian Jaehn & Sergey Kovalev & Mikhail Y. Kovalyov & Erwin Pesch, 2014. "Multiproduct batching and scheduling with buffered rework: The case of a car paint shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 458-471, September.

    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. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    2. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    3. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    4. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    5. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.
    6. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    7. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    8. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.
    9. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    10. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    11. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    12. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    13. Gregory H. Graves & Chung‐Yee Lee, 1999. "Scheduling maintenance and semiresumable jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 845-863, October.
    14. Kenneth R. Baker, 1999. "Heuristic procedures for scheduling job families with setups and due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 978-991, December.
    15. Malapert, Arnaud & Guéret, Christelle & Rousseau, Louis-Martin, 2012. "A constraint programming approach for a batch processing problem with non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 221(3), pages 533-545.
    16. Paul Schikora & Andrew Manikas & Michael Godfrey, 2015. "Determining Optimal Flow-Time Schedules For The Multiple-Product Batch-Flow Problem," International Journal of Management and Marketing Research, The Institute for Business and Finance Research, vol. 8(2), pages 19-35.
    17. Lin, B. M. T. & Jeng, A. A. K., 2004. "Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 91(2), pages 121-134, September.
    18. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    19. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
    20. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, 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:eee:proeco:v:51:y:1997:i:3:p:165-176. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.