https://ira.lib.polyu.edu.hk/bitstream/10397/1269/1/SetupSurvey-2006%28June-19%29.pdf

A survey of scheduling problems with setup times or costs

There are many practical production systems with distribution operations where finished jobs are transferred from supplier to the customer by transporters. In these systems, the coordination of production and logistics operations can help to improve overall system performance and reduce the total operation cost. This paper focuses on two categories of integrated scheduling problems. One is Integrated Scheduling of Production–Distribution Problems (ISPDP) and the other is Integrated Scheduling of Production–Inventory–Distribution Problems (ISPIDP). This paper presents a review of the state–of–the–art articles and suggests the corresponding further research directions for the above two categories of integrated scheduling problems.

Integrated scheduling of production and distribution operations: A review

A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups

The scheduling of jobs over a single machine with sequence dependent setups is a classical problem setting that appears in many practical applications in production planning and logistics. In this work, we analyze six mixed-integer formulation paradigms for this classical context considering release dates and two objective functions: the total weighted completion time and the total weighted tardiness. For each paradigm, we present and discuss a MIP formulation, introducing in some cases new constraints to improve performance. A dominance hierarchy in terms of strength of their linear relaxations bounds is developed. We report extensive computational experiments on a variety of instances to capture several aspects of practical situations, allowing a comparison regarding size, linear relaxation and overall performance. Based on the results, discussions and recommendations are made for the considered problems.

/pdf/analysis-of-mixed-integer-programming-formulations-for-n68p1dq3di.pdf

Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates

We address the three-machine flowshop scheduling problem to minimise maximum lateness, where setup times are considered separate from processing times. We establish a dominance relation for the problem where it specifies which of the two adjacent jobs should precede in an optimal solution. Moreover, we propose three heuristics: Earliest Due Date (EDD), an Enhanced Earliest Due Date (EEDD) and a Polynomial Genetic-based Algorithm (PGA). We conduct computational analysis on randomly generated problems to evaluate the performance of the proposed heuristics. The analysis shows that the performance of EEDD is acceptable if the computational time is of the main concern and the number of jobs are large. The analysis also shows that PGA significantly outperforms EDD and EEDD.

Hung-Liang Cheng

Papers

A heuristic approach for single-machine scheduling with due dates and class setups