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

Shop Problems With Two Machines And Time Lags

M. Dell'Amico
Published 1996 · Computer Science

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
We consider Job-Shop and Flow-Shop scheduling problems with two machines, no more than two operations per job, and Time Lags, i.e., a minimum time interval between the completion time of the first operation and the starting time of the second one. We give complexity results for the preemptive and nonpreemptive cases and study the relationship between the two problems. For the Flow-Shop problem we give lower bounds and upper bounds and analyze their worst-case performances. Finally we define a Tabu Search algorithm and prove the effectiveness of the proposed bounds through extensive computational results.
This paper references



This paper is referenced by
10.1007/S10479-018-3082-X
Exact method for the two-machine flow-shop problem with time delays
M. Mkadem (2021)
10.1016/j.ejor.2019.08.045
Coupled task scheduling with exact delays: Literature review and models
M. Khatami (2020)
10.1007/s10479-018-2967-z
Two-machine flowshop scheduling problem with coupled-operations
N. Meziani (2019)
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.3390/su11246885
Minimizing Makespan in A Two-Machine Flowshop Problem with Processing Time Linearly Dependent on Job Waiting Time
D. Yang (2019)
10.1007/s40092-019-00331-1
MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
Imen Hamdi (2019)
10.2139/ssrn.3333563
Coupled Task Scheduling With Exact Delays: Literature Review and Models
M. Khatami (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.1109/CoDIT.2017.8102675
A branch-and-bound algorithm for the two-machine flow-shop problem with time delays
M. Mkadem (2017)
10.1016/J.TCS.2017.01.018
Flowshop problem F2D
Yan Lan (2017)
10.1007/S10033-017-0108-2
Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags
Ning Zhao (2017)
10.1016/j.ipl.2015.09.003
Complexity of problem TF2|v=1, c=2|Cmax
Yan Lan (2016)
10.1080/0305215X.2015.1099639
Minimizing the total completion time in a two-machine flowshop problem with time delays
Mohamed Kais Msakni (2016)
Optimal Production Schedule with Arbitrary Lags and Job Block Criteria Consisting Graphical User Interface Using Matlab
D. Gupta (2016)
Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines
Alexander A. Ageev (2016)
10.1016/J.APM.2015.11.021
Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
D. Shabtay (2016)
10.1016/J.IPL.2015.09.003
Complexity of problem TF 2
Yan Lan (2016)
10.1007/978-3-319-55702-1_70
Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
M. Mkadem (2016)
10.1051/ro/2015015
Two machines flow shop with reentrance and exact time lag
Karim Amrouche (2016)
10.1007/s12351-014-0166-5
Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
Imen Hamdi (2015)
NP-complétude du problème du flowshop à deux machines avec des opérations couplées
A. Oulamara (2015)
10.1155/2014/273567
The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures
Anis Gharbi (2014)
10.1016/J.OMEGA.2013.07.001
A combined robot selection and scheduling problem for flow-shops with no-wait restrictions
D. Shabtay (2014)
A Mathematical analysis of Rental cost objective Scheduling Techniques
Shashi Bala (2014)
10.1109/CoDIT.2014.6996865
Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags
Imen Hamdi (2014)
10.1007/s10878-012-9511-x
Preemptive scheduling on two identical parallel machines with a single transporter
H. Kellerer (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.1111/j.1475-3995.2012.00876.x
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
Emna Dhouib (2013)
10.12732/IJPAM.V86I5.1
A HEURISTIC FOR TWO MACHINE OPEN SHOP SPECIALLY STRUCTURED SCHEDULING PROBLEM TO MINIMIZE THE RENTAL COST, INCLUDING JOB BLOCK CRITERIA
D. Gupta (2013)
10.1007/978-1-4614-5152-5_6
The No-Wait Flow Shop
H. Emmons (2013)
10.1007/978-1-4614-5152-5_3
Transfer Lags in the Flow Shop
H. Emmons (2013)
OPTIMAL TWO STAGE OPEN SHOP SCHEDULING IN WHICH PROCESSING TIME, SET UP TIME ASSOCIATED WITH THEIR RESPECTIVE PROBABILITIES
D. Gupta (2013)
See more
Semantic Scholar Logo Some data provided by SemanticScholar