A bicriteria scheduling with sequence-dependent setup times

DOI10.1016/j.amc.2005.11.112zbMath1125.90352OpenAlexW2006328860MaRDI QIDQ2506355

Tamer Eren, Ertan Güner

Publication date: 28 September 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.112

zbMATH Keywords

single machine schedulingsequence dependent setup timesbicriteria0-1 integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ A bicriteria parallel machine scheduling with a learning effect of setup and removal times ⋮ Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ A survey of scheduling problems with setup times or costs ⋮ A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study

Uses Software

• LINDO

Cites Work

• Real-time scheduling of an automated manufacturing center
• Hybrid algorithm for sequencing with bicriteria
• Scheduling in a sequence dependent setup environment with genetic search
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Future paths for integer programming and links to artificial intelligence
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling tasks with sequence-dependent processing times
• On general routing problems
• A Survey of Scheduling Rules
• The Delivery Man Problem and Cumulative Matroids
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Survey of scheduling research involving setup times
• The traveling salesman problem with cumulative costs
• A memetic algorithm for the total tardiness single machine scheduling problem