Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
From MaRDI portal
Publication:5432690
DOI10.1093/imaman/dpm016zbMath1177.90151OpenAlexW2048426633MaRDI QIDQ5432690
Mateus Rocha de Paula, Panos M. Pardalos, Geraldo Robson Mateus, Martín Gómez Ravetti
Publication date: 18 December 2007
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dpm016
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling ⋮ Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ An iterative approach for the serial batching problem with parallel machines and job families ⋮ On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date ⋮ Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem ⋮ Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ Variable neighbourhood search: methods and applications ⋮ Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ Variable neighbourhood search: Methods and applications ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Uses Software
This page was built for publication: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
