Abstract
In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource-constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.
| Original language | English |
|---|---|
| Pages (from-to) | 1422-1441 |
| Number of pages | 20 |
| Journal | International Transactions in Operational Research |
| Volume | 32 |
| Issue number | 3 |
| DOIs | |
| Publication status | Accepted/In press - 2024 |
Keywords
- constraint programming
- group shop
- job shop
- mixed shop
- open shop
- parallel machines
- resource-constrained project scheduling
- stage shop
ASJC Scopus subject areas
- Business and International Management
- Computer Science Applications
- Strategy and Management
- Management Science and Operations Research
- Management of Technology and Innovation