This paper considers a cutting and scheduling problem of minimizing scrap motivated by float glass manufacturing and introduces the FGSP (float glass scheduling problem). We relate it to classical problems in the scheduling literature such as no-wait hybrid flow shops and cyclic scheduling. We show that the problem is NP-hard, and identify when each of the problem’s components are polynomially ...

Abstract This paper addresses a multi-objective energy-efficient scheduling problem of the distributed permutation flowshop with sequence-dependent setup time and no-wait constraints (EEDNWFSP), which have important practical applications. Two objectives minimization both makespan total energy consumption (TEC) are considered simultaneously. To address this problem, new mixed-integer linear pro...

A flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow non-permutation flowshop scheduling (NPFS) and job sequences to be changed on different machines. A mixed-integer linear programming model for non-permutation flowshop scheduling and the buffer requirement along with manufacturing implication i...

In this article, we present a study that compares variants of two ACO algorithms designed to tackle a biobjective permutation flowshop scheduling problem where the makespan and the total tardiness are the objectives considered. These two algorithms use respectively one and two pheromone matrices. The analysis of the results gives indications on the choices to adopt when designing an ACO approac...

Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...

We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...

In this paper, a general multi-level decomposition based framework has been proposed for integration of planning and scheduling in a multi-site, multi-product plant, with applications to paper manufacturing. The problem involves complex issues relating to large-scale production in a hybrid flowshop configuration, decisions relating to minimizing trim losses, while maintaining on-time delivery o...