Efficient Solution Methods for Just-In-Time Machine and Shop Scheduling Problems
- Publication Type:
- Thesis
- Issue Date:
- 2022
Open Access
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
The classical machine (i.e., single and parallel machine) and shop scheduling (i.e., flow-shop, job-shop and open-shop) problems are concerned with performing a set of jobs on a given set of machines with or without precedence relations. This thesis explores variants of such problems, pertinent to the practice of Just-In-Time (JIT) manufacturing, where each job (operation) has a due date (or due window) and any deviation from it would incur either earliness or tardiness costs. Embracing JIT philosophy by companies and the need for developing realistic scheduling models have led to a growing body of research on earliness- tardiness minimization. Yet, most studies have been devoted to single machine scheduling problems and little research has been conducted to address the multiple-machine or shop scheduling settings. Moreover, the current solution methodologies often fail to deliver quality solutions particularly as the size of instances grows. Therefore, this PhD thesis will contribute to developing efficient algorithms being capable of obtaining high quality solutions for computationally challenging instances. In addition, we contribute to the existing approaches by integrating exact and heuristic algorithms to maximize the benefits associated with them.
Please use this identifier to cite or link to this item: