Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

DOI10.1016/j.cor.2018.07.007zbMath1458.90289OpenAlexW2887704695WikidataQ129384361 ScholiaQ129384361MaRDI QIDQ1628056

Luis Fanjul-Peyro, Federico Perea, Rubén Ruiz

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/156847

zbMATH Keywords

schedulingmakespanparallel machinesequence dependent setup times

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling

Uses Software

• CPLEX
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• Thirty years of heterogeneous vehicle routing
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Unrelated parallel machine scheduling using local search
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer linear programming formulations of multiple salesman problems and its variations
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Integer Programming Formulation of Traveling Salesman Problems
• Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Planning and Scheduling in Manufacturing and Services

This page was built for publication: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times