Scheduling batches in flowshop with limited buffers in the shampoo industry

Belaid, Rabah; t'Kindt, Vincent; Esswein, Carl

doi:10.1016/j.ejor.2012.06.035

Cited by 13 publications

(8 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We develop a mathematical model to minimize makespan, a measure of service level and total energy consumption, an indicator of environmental sustainability in a two-machine permutation flowshop scheduling problem that is characterized by sequence dependent setups. Twomachine flowshop scheduling problems have many real world applications including metalworking (Uruk, Gultekin, & Akturk, 2013), printed circuit board (PCB) manufacturing (Sabouni & Logendran, 2013) and shampoo industry (Belaid, T'kindt, & Esswein, 2012) among others. As a result, two-machine scheduling problems have attracted significant attention from practitioners and researchers.…”

Section: Introductionmentioning

confidence: 99%

Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption

Mansouri

Aktaş

Beşikçi³

2016

European Journal of Operational Research

241

View full text Add to dashboard Cite

a b s t r a c tSustainability considerations in manufacturing scheduling, which is traditionally influenced by service oriented performance metrics, have rarely been adopted in the literature. This paper aims to address this gap by incorporating energy consumption as an explicit criterion in shop floor scheduling. Leveraging the variable speed of machining operations leading to different energy consumption levels, we explore the potential for energy saving in manufacturing. We analyze the trade-off between minimizing makespan, a measure of service level and total energy consumption, an indicator for environmental sustainability of a two-machine sequence dependent permutation flowshop. We develop a mixed integer linear multi-objective optimization model to find the Pareto frontier comprised of makespan and total energy consumption. To cope with combinatorial complexity, we also develop a constructive heuristic for fast trade-off analysis between makespan and energy consumption. We define lower bounds for the two objectives under some non-restrictive conditions and compare the performance of the constructive heuristic with CPLEX through design of experiments. The lower bounds that we develop are valid under realistic assumptions since they are conditional on speed factors. The Pareto frontier includes solutions ranging from expedited, energy intensive schedules to prolonged, energy efficient schedules. It can serve as a visual aid for production and sales planners to consider energy consumption explicitly in making quick decisions while negotiating with customers on due dates. We provide managerial insights by analyzing the areas along the Pareto frontier where energy saving can be justified at the expense of reduced service level and vice versa.

show abstract

Section: Introductionmentioning

confidence: 99%

Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption

Mansouri

Aktaş

Beşikçi³

2016

European Journal of Operational Research

241

View full text Add to dashboard Cite

show abstract

“…Pan et al (2017), for instance, present an iterated search with greedy and local search to minimize earliness and tardiness in a hybrid flow shop. Belaid et al (2012) use a greedy algorithm, a novel ant colony optimization with features of simulated annealing (taken from T'kindt et al (2002)) and a dedicated heuristic to solve a practical case in the shampoo industry. For further examples of holistic heuristics, we refer to Komaki et al (2016), Lei and Guo (2016) and Liu et al (2017).…”

Section: Literature Reviewmentioning

confidence: 99%

Scheduling hybrid flow shops with time windows

Yang

Leus

2019

J Heuristics

View full text Add to dashboard Cite

Hybrid flow shops can be encountered in various industrial settings. In this paper we develop methods for scheduling hybrid flow shops with hard time windows. Specifically, we study a two-stage hybrid flow shop scheduling problem with time windows to minimize the total weighted completion times. Each stage consists of one or more identical parallel machines, and each job visits two processing stages in series. Finding a feasible schedule with hard time windows is a challenging task in this setting, because it is NP-complete in the strong sense even for a single machine in a single stage. We propose two matheuristics to find an initial feasible solution by local branching. We also develop two schedule improvement procedures, one based on stage-by-stage decomposition, and one using adapted local branching. The performance of our methods is validated via extensive computational experiments.

show abstract

“…There are many real world problems that involve scheduling of two machines. These include applications for instance in printed circuit board (Sabouni and Logendran, 2013), shampoo production (Belaid et al, 2012), and metalworking (Uruk et al, 2013). In this paper, we extend the work of Mansouri et al (2016) by developing a new O(n 2 ) heuristic and multi-objective genetic algorithms (MOGAs) for a sequence-dependent two-machine permutation flowshop scheduling problem to extend applicability of the concept of green scheduling in real life applications.…”

Section: Introductionmentioning

confidence: 99%

Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem

Mansouri

Aktaş

2016

Journal of the Operational Research Society

View full text Add to dashboard Cite

Energy consumption has become a key concern for manufacturing sector because of negative environmental impact of operations. We develop constructive heuristics and multi-objective genetic algorithms (MOGA) for a two-machine sequence-dependent permutation flowshop problem to address the trade-off between energy consumption as a measure of sustainability and makespan as a measure of service level. We leverage the variable speed of operations to develop energy-efficient schedules that minimize total energy consumption and makespan. As minimization of energy consumption and minimization of makespan are conflicting objectives, the solutions to this problem constitute a Pareto frontier. We compare the performance of constructive heuristics and MOGAs with CPLEX and random search in a wide range of problem instances. The results show that MOGAs hybridized with constructive heuristics outperform regular MOGA and heuristics alone in terms of quality and cardinality of Pareto frontier. We provide production planners with new and scalable solution techniques that will enable them to make informed decisions considering energy consumption together with service objectives in shop floor scheduling.

show abstract

Scheduling batches in flowshop with limited buffers in the shampoo industry

Cited by 13 publications

References 17 publications

Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption

Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption

Scheduling hybrid flow shops with time windows

Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem

Contact Info

Product

Resources

About