This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the pr...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

Industrial and academic interest converge on scheduling flow shops with sequence- time-dependent maintenance. We posit that anticipatory, integrated of operational maintenance tasks leads to superior performance purely ‘wait-then-fix’ handling the tasks. Motivated by an industrial problem (sequence dependent) setup times, maximum separation constraints, a combination time- dependent tasks, this...

This paper introduces and compares several formulations of a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The setup time is divided into two parts: one that can be performed at any time and another one that is restricted to be made outside of a given time interval. As a result, the setup time between two jobs is a function of the comp...

In this study, we consider single-machine scheduling problems with past-sequence-dependent (denoted by psd) setup times in which the of jobs are proportional to length already processed jobs. Under common (CON) and slack (SLK) due-date assignment methods, prove that weighted sum earliness, tardiness minimization remains polynomially solvable. We also give some extensions for psd times.

Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry print industry. There exist several metaheuristic algorithms to solve this problem. However, within time limits, those still either find low quality solutions or struggle large problems. In paper...