Online citations, reference lists, and bibliographies.
← Back to Search

A Two-machine Flowshop Sequencing Problem With Limited Waiting Time Constraints

D. Yang, Maw-Sheng Chern
Published 1995 · Mathematics

Save to my Library
Download PDF
Analyze on Scholarcy Visualize in Litmaps
Share
Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager
Time to take this seriously.
Get Citationsy
Abstract We consider a two-machine flowshop sequencing problem with limited waiting time constraints. This means that for each job the waiting time between two machines cannot be greater than a given upper bound. The objective is to minimize the makespan. There are efficient algorithms for the special cases of infinite waiting time and zero waiting time. The two-machine flowshop sequencing problem with limited waiting time constraints is shown to be NP-hard. A branch-and-bound algorithm is proposed, and computational experiments are provided.
This paper references



This paper is referenced by
10.1016/J.PROCIR.2021.05.008
Data analytics for time constraint adherence prediction in a semiconductor manufacturing use-case
M. May (2021)
10.1155/2020/8833645
A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times
Ju-Yong Lee (2020)
10.1016/j.eswa.2020.113556
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
C. P. Tomazella (2020)
10.1080/0305215X.2019.1593974
A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
Y. Li (2020)
10.1016/J.CIE.2019.07.048
Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints
Hamed Samarghandi (2019)
10.1016/j.cor.2018.06.009
Three-machine flow shop scheduling with overlapping waiting time constraints
H. Kim (2019)
10.3390/su11246885
Minimizing Makespan in A Two-Machine Flowshop Problem with Processing Time Linearly Dependent on Job Waiting Time
D. Yang (2019)
10.1109/TSM.2018.2826530
Job Dispatch Control for Production Lines With Overlapped Time Window Constraints
M. Wang (2018)
10.1016/J.JMSY.2018.01.001
Analysis, design, and control of Bernoulli production lines with waiting time constraints
Jun-Ho Lee (2018)
10.1109/TASE.2016.2642997
Scheduling Cluster Tools in Semiconductor Manufacturing: Recent Advances and Challenges
C. Pan (2018)
10.1016/j.cie.2018.04.021
Permutation flowshop scheduling with time lag constraints and makespan criterion
Bailin Wang (2018)
10.1007/s10479-018-2775-5
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Emna Dhouib (2018)
10.1155/2018/2615096
Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching
F. Chu (2018)
10.1088/1757-899X/337/1/012006
Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem
B. Santosa (2018)
Ordonnancement d'un système de production industriel complexe : flow shop hybride avec des machines dédiées soumis à différentes contraintes temporelles. (Scheduling of a complex industrial production system : hybrid flow shop with dedicated machines and different time constraints)
H. Harbaoui (2018)
10.1016/J.IFACOL.2017.08.391
A Branch and Bound Algorithm for Three-Machine Flow Shop with Overlapping Waiting Time Constraints
H. Kim (2017)
10.15302/J-FEM-2017034
Two-stage scheduling on batch and single machines with limited waiting time constraint
Zhongshun Shi (2017)
10.1007/S10033-017-0108-2
Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags
Ning Zhao (2017)
10.1080/00207543.2015.1129468
Production control policy for tandem workstations with constant service times and queue time constraints
Kan Wu (2016)
10.1016/j.cie.2016.04.003
Multiple product admission control in semiconductor manufacturing systems with process queue time (PQT) constraints
Cheng-Hung Wu (2016)
10.1016/j.cor.2016.01.017
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
Young-Jin An (2016)
10.1007/s10479-013-1398-0
A general model for batch building processes under the timeout and capacity rules
Justus A. Schwarz (2015)
10.2991/ESAC-15.2015.52
Gene Shift Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Limited Waiting Times
Bailin Wang (2015)
10.1109/CCDC.2015.7161997
A comparison of two-machine flowshop with availability constraints for limited waiting time
Yanhui Yu (2015)
10.1109/ASMC.2015.7164446
Production control in semiconductor manufacturing with time constraints
R. Sadeghi (2015)
10.1080/0951192X.2013.820348
Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints
S. F. Attar (2014)
10.1007/s11590-012-0574-5
Scheduling with a position-weighted learning effect
T. Cheng (2014)
10.11591/TELKOMNIKA.V12I4.4783
Scheduling Two-machine Flowshop with Limited Waiting Times to Minimize Makespan
Bailin Wang (2014)
10.4028/www.scientific.net/AMM.631-632.66
Partheno-Genetic Algorithm for the Permutation Flowshop Scheduling Problem with Maximum Waiting Times
B. Wang (2014)
10.1109/WSC.2013.6721724
Two-stage lot scheduling with waiting time constraints and due dates
Tae-Sun Yu (2013)
10.1002/9781118731598.CH4
A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags
Emna Dhouib (2013)
10.1007/S00170-013-4956-3
Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times
S. F. Attar (2013)
See more
Semantic Scholar Logo Some data provided by SemanticScholar