On the complexity of proportionate open shop and job shop problems

DOI10.1007/s11590-023-02000-0OpenAlexW4362596021MaRDI QIDQ6181381

Djamal Rebaine, Abdennour Azerine, Mourad Boudhar

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-02000-0

zbMATH Keywords

complexityschedulingmakespanjust-in-timemaximum latenessmean finish timeproportionate shop

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The two-machine no-wait general and proportionate open shop makespan problem
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• The proportionate two-machine no-wait job shop scheduling problem
• The just-in-time scheduling problem in a flow-shop scheduling system
• A note: minimizing maximum earliness on a proportionate flowshop
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• Minimizing total weighted completion time in a proportionate flow shop
• Scheduling two-machine preemptive open shops to minimize total completion time
• A two-machine no-wait flow shop problem with two competing agents
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Some positive news on the proportionate open shop problem
• Focused Scheduling in Proportionate Flowshops
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Polynomial time approximation algorithms for proportionate open‐shop scheduling

This page was built for publication: On the complexity of proportionate open shop and job shop problems