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

Mathematical programming formulations for machine scheduling: A survey

Author

Listed:
  • Blazewicz, Jacek
  • Dror, Moshe
  • Weglarz, Jan

Abstract

No abstract is available for this item.

Suggested Citation

  • Blazewicz, Jacek & Dror, Moshe & Weglarz, Jan, 1991. "Mathematical programming formulations for machine scheduling: A survey," European Journal of Operational Research, Elsevier, vol. 51(3), pages 283-300, April.
    • Handle: RePEc:eee:ejores:v:51:y:1991:i:3:p:283-300
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(91)90304-E
    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. Dong, Yachao & Maravelias, Christos T., 2021. "Terminal inventory level constraints for online production scheduling," European Journal of Operational Research, Elsevier, vol. 295(1), pages 102-117.
    2. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    3. Abdeljaouad, Mohamed Amine & Bahroun, Zied & Omrane, Anissa & Fondrevelle, Julien, 2015. "Job-shop production scheduling with reverse flows," European Journal of Operational Research, Elsevier, vol. 244(1), pages 117-128.
    4. Jordan, Carsten & Drexl, Andreas, 1993. "A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 322, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Renata Mansini & Roberto Zanotti, 2020. "Optimizing the physician scheduling problem in a large hospital ward," Journal of Scheduling, Springer, vol. 23(3), pages 337-361, June.
    6. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    7. 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.
    8. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    9. 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.
    10. Crescenzio Gallo, 2004. "Un Algoritmo Di Simulated Annealing Per La Soluzione Di Un Problema Di Scheduling," Quaderni DSEMS 16-2004, Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia.
    11. Jonathan F. Bard & Siwate Rojanasoonthon, 2006. "A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 24-44, February.
    12. Neufeld, Janis S. & Schulz, Sven & Buscher, Udo, 2023. "A systematic review of multi-objective hybrid flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 309(1), pages 1-23.
    13. Hanif D. Sherali & Youngho Lee & Donald D. Boyer, 1995. "Scheduling target illuminators in naval battle‐group anti‐air warfare," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 737-755, August.
    14. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    15. Szmerekovsky, Joseph G. & Venkateshan, Prahalad & Simonson, Peter D., 2023. "Project scheduling under the threat of catastrophic disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 784-794.
    16. Prot, D. & Bellenguez-Morineau, O. & Lahlou, C., 2013. "New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria," European Journal of Operational Research, Elsevier, vol. 231(2), pages 282-287.
    17. Palmowski, Zbigniew & Sidorowicz, Aleksandra, 2020. "An application of dynamic programming to assign pressing tanks at wineries," European Journal of Operational Research, Elsevier, vol. 287(1), pages 293-305.
    18. Federico Della Croce, 2016. "MP or not MP: that is the question," Journal of Scheduling, Springer, vol. 19(1), pages 33-42, February.
    19. Lalla-Ruiz, Eduardo & Voß, Stefan, 2016. "Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs," European Journal of Operational Research, Elsevier, vol. 255(1), pages 21-33.

    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:51:y:1991:i:3:p:283-300. 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.