Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

DOI10.1007/s11590-014-0761-7zbMath1310.90067OpenAlexW2008789329MaRDI QIDQ2018863

Imen Hamdi, Taïcir Loukil

Publication date: 25 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0761-7

zbMATH Keywords

upper boundsschedulinglower boundspermutation flowshoptime lags

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic, Logic-Based Benders Decomposition for Large-Scale Optimization

Cites Work

• Unnamed Item
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Logic-based Benders decomposition
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• Minimizing tardy jobs in a flowshop with common due date
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Planning and Scheduling by Logic-Based Benders Decomposition
• Planning and Scheduling to Minimize Tardiness
• Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Principles and Practice of Constraint Programming – CP 2004