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

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Author

Listed:
  • Prot, D.
  • Bellenguez-Morineau, O.
  • Lahlou, C.

Abstract

In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized. We show that solutions having a permutation flow shop structure are dominant if there exists an optimal solution with completion times scheduled in the same order as the release dates, or if there is no release date. We also prove that, for a subclass of these problems, the completion times of all jobs can be ordered in an optimal solution. Using these two results, we provide new results on polynomially solvable problems and hence refine the boundary between P and NP for these problems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:231:y:2013:i:2:p:282-287
    DOI: 10.1016/j.ejor.2013.05.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171300458X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.05.041?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.

    References listed on IDEAS

    as
    1. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    2. 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.
    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. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    2. Choo Jun Tan & Siew Chin Neoh & Chee Peng Lim & Samer Hanoun & Wai Peng Wong & Chu Kong Loo & Li Zhang & Saeid Nahavandi, 2019. "Application of an evolutionary algorithm-based ensemble model to job-shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(2), pages 879-890, February.
    3. Hui-Chih Hung & Bertrand M. T. Lin & Marc E. Posner & Jun-Min Wei, 2019. "Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs," Journal of Scheduling, Springer, vol. 22(4), pages 413-431, August.
    4. Yabo Luo, 2017. "Nested optimization method combining complex method and ant colony optimization to solve JSSP with complex associated processes," Journal of Intelligent Manufacturing, Springer, vol. 28(8), pages 1801-1815, December.
    5. Miguel A. Ortíz & Leidy E. Betancourt & Kevin Parra Negrete & Fabio Felice & Antonella Petrillo, 2018. "Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry," Annals of Operations Research, Springer, vol. 264(1), pages 409-433, May.

    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. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    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. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    4. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    5. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    6. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    7. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    8. Federico Della Croce, 2016. "MP or not MP: that is the question," Journal of Scheduling, Springer, vol. 19(1), pages 33-42, February.
    9. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    10. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    11. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    12. 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.
    13. 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.
    14. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    15. Viswanath Nagarajan & Joel Wolf & Andrey Balmin & Kirsten Hildrum, 2019. "Malleable scheduling for flows of jobs and applications to MapReduce," Journal of Scheduling, Springer, vol. 22(4), pages 393-411, August.
    16. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    17. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    18. Eric Angel & Evripidis Bampis & Fadi Kacem & Dimitrios Letsios, 2019. "Speed scaling on parallel processors with migration," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1266-1282, May.
    19. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.
    20. Xiaoqiang Cai & George L. Vairaktarakis, 2012. "Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs," Operations Research, INFORMS, vol. 60(6), pages 1436-1450, December.

    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:231:y:2013:i:2:p:282-287. 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/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.