A systematic review of permutation flow shop scheduling with due-date-related objectives
B de Athayde Prata, LR de Abreu… - Computers & Operations …, 2025 - Elsevier
The permutation flow shop is one of the most studied combinatorial optimization problems
by operational research practitioners in the last decades, given its theoretical and practical …
by operational research practitioners in the last decades, given its theoretical and practical …
Joint algorithm of message fragmentation and no-wait scheduling for time-sensitive networks
Time-sensitive networks (TSNs) support not only traditional best-effort communications but
also deterministic communications, which send each packet at a deterministic time so that …
also deterministic communications, which send each packet at a deterministic time so that …
Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review
Flow shop scheduling is a type of scheduling where sequence follows for each job on a set
of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and …
of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and …
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
K Maassen, P Perez-Gonzalez, LC Günther - Computers & Operations …, 2020 - Elsevier
This paper focuses on two components of idle time and waiting time, namely core idle
time,∑ CIT i, and core waiting time,∑ CWT j. Both measures are relevant indicators of the …
time,∑ CIT i, and core waiting time,∑ CWT j. Both measures are relevant indicators of the …
[HTML][HTML] MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem
We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total
tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations …
tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations …
[HTML][HTML] Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry
In this paper, we address a variant of a batch scheduling problem with identical parallel
machines and non-anticipatory family setup times to minimize the total weighted completion …
machines and non-anticipatory family setup times to minimize the total weighted completion …
A hybrid scatter search method for solving fuzzy no-wait flow-shop scheduling problems
The literature published since the year 2000 was reviewed regarding the no-wait flow-shop
scheduling (No-WFSS) problem. The No-WFSS problem with separate set-up times and …
scheduling (No-WFSS) problem. The No-WFSS problem with separate set-up times and …
An energy-efficient no idle permutations flow shop scheduling problem using grey wolf optimizer algorithm
Energy consumption has become a significant issue in businesses. It is known that the
industrial sector has consumed nearly half of the world's total energy consumption in some …
industrial sector has consumed nearly half of the world's total energy consumption in some …
Green scheduling of identical parallel machines with release date, delivery time and no-idle machine constraints
Global warming and climate change are threatening life on earth. These changes are due to
human activities resulting in the emission of greenhouse gases. This is caused by intensive …
human activities resulting in the emission of greenhouse gases. This is caused by intensive …
A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
This article addresses the no-wait permutation flowshop layout where the jobs must be
processed continuously in the available machines without interruption. The objective …
processed continuously in the available machines without interruption. The objective …