IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v29y1987i3p298-306.html
   My bibliography  Save this article

Scheduling jobs with release dates and tails on identical machines to minimize the makespan

Author

Listed:
  • Carlier, Jacques

Abstract

No abstract is available for this item.

Suggested Citation

  • Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
    • Handle: RePEc:eee:ejores:v:29:y:1987:i:3:p:298-306
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(87)90243-8
    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.

    Citations

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


    Cited by:

    1. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    2. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    3. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    4. Jacques Carlier & Claire Hanen, 2024. "Measuring the slack between lower bounds for scheduling on parallel machines," Annals of Operations Research, Springer, vol. 338(1), pages 347-377, July.
    5. Li Kai & Li Hui & Cheng Bayi & Luo Qing, 2015. "Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times," Journal of Systems Science and Information, De Gruyter, vol. 3(6), pages 525-537, December.
    6. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    7. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    9. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.
    10. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    11. Schutten, J. M. J. & Leussink, R. A. M., 1996. "Parallel machine scheduling with release dates, due dates and family setup times," International Journal of Production Economics, Elsevier, vol. 46(1), pages 119-125, December.
    12. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    13. Lancia, Giuseppe, 2000. "Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 120(2), pages 277-288, January.
    14. Koulamas, Christos & Kyparisis, George J., 2004. "Makespan minimization on uniform parallel machines with release times," European Journal of Operational Research, Elsevier, vol. 157(1), pages 262-266, August.
    15. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    16. Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    17. Berkoune, Djamel & Mesghouni, Khaled, 2008. "Resolution approach for multi-objective problems with uncertain demands," European Journal of Operational Research, Elsevier, vol. 187(2), pages 403-414, June.
    18. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    19. V C Ivănescu & J W M Bertrand & J C Fransoo & J P C Kleijnen, 2006. "Bootstrapping to solve the limited data problem in production control: an application in batch process industries," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 2-9, January.
    20. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
    21. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    22. Ann Vandevelde & Han Hoogeveen & Cor Hurkens & Jan Karel Lenstra, 2005. "Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 305-320, August.

    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:ejores:v:29:y:1987:i:3:p:298-306. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.