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

DOI10.1007/S11590-014-0761-7zbMATH Open1310.90067OpenAlexW2008789329MaRDI QIDQ2018863FDOQ2018863

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

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

zbMATH Keywords

lower boundsschedulingupper boundspermutation flowshoptime lags

Mathematics Subject Classification ID

Continuous location (90B85)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Logic-based Benders decomposition
• Planning and Scheduling by Logic-Based Benders Decomposition
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Minimizing tardy jobs in a flowshop with common due date
• Principles and Practice of Constraint Programming – CP 2004
• Planning and Scheduling to Minimize Tardiness
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• Single-facility scheduling over long time horizons by logic-based Benders decomposition

Cited In (13)

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

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)