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

DOI10.1007/S11590-014-0761-7MaRDI QIDQ2018863zbMATH OpenOpenAlexFDO

Authors Imen Hamdi, Taicir 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

lower boundsschedulingupper boundspermutation flowshoptime lags

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• Permutation flowshop scheduling problems with maximal and minimal time lags
• The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Permutation flow shops with exact time lags to minimise maximum lateness
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Logic-based Benders decomposition
• Minimizing tardy jobs in a flowshop with common due date
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Planning and Scheduling by Logic-Based Benders Decomposition
• Planning and Scheduling to Minimize Tardiness
• Principles and Practice of Constraint Programming – CP 2004
• Single-facility scheduling over long time horizons by logic-based Benders decomposition

Cited in

(13)

• An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
• Permutation flow shops with exact time lags to minimise maximum lateness
• Logic-based Benders decomposition for large-scale optimization
• Permutation flowshop scheduling problems with maximal and minimal time lags
• The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Minimizing total tardiness in permutation flowshops
• Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• Polynomial time algorithms for the UET permutation flowshop problem with time delays
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

This page was built for publication: Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018863)