In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Models for Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) is considered. This challenging real problem, that emerged nowadays industry, corresponds a flexible job with sequencing flexibility; it presents several complicati...

In this study, we consider a particular version of the hybrid flexible flow shop (HFFS) scheduling problem, inspired from real-life application in printing industry. The considered problem is variation classical Flow which specific constraints are jointly considered, such as non-identical parallel machines, sequence-dependent setups on machine eligibility, and precedence among jobs, order to mi...

The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...

Job shop scheduling problems with stochastic processing and sequence-dependent setup times and dynamic arrival of job types are real world and most complex among various scheduling problems. This paper extends the previous work of Sharma and Jain (2015) by assessing the performance of proposed four setups oriented dispatching rules with respect to bench mark dispatching rule taken from literatu...

In the present work, an industrial case study has been considered for multi-objective flow shop scheduling problem including the sequence dependent set up time. The multi-objectives include the minimization of sum of total weighted squared tardiness, total weighted squared earliness, makespan and number of tardy jobs. Industries can select the optimal sequence with respect to required objective...

We describe a new solution approach for order sequencing which reflects the build-to-order strategy of the European automobile industry. Therefore, it has to cope with a daily changing variety of customer orders. Each order consists of a set of commodities which are implemented while the order sequence passes through a body shop, a paint shop, and an assembly shop. Existing solution approaches ...

This paper is concerned with hybrid flow-shop scheduling problem involving multiprocessor tasks. The hybrid flow-shop problem is a generalization of the classical flow-shop problem by permitting multiple parallel processors at each stage of task processing. The multiprocessor tasks, on the other hand, overcome the restriction of the classical scheduling problems by allowing tasks to be processe...