A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
From MaRDI portal
Publication:1634053
DOI10.1016/j.cor.2018.10.010zbMath1458.90253OpenAlexW2896685544WikidataQ129095410 ScholiaQ129095410MaRDI QIDQ1634053
Publication date: 17 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.010
simulated annealingtabu searchsequence-dependent setup timesunrelated parallel machine schedulingdispatching rulescheduling with a common server
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ General variable neighborhood search for the parallel machine scheduling problem with two common servers ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Scheduling with day shifts and breaks ⋮ Short‐term scheduling with machine calibration ⋮ Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions ⋮ A two-stage solution approach for plastic injection machines scheduling problem ⋮ Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Optimization by Simulated Annealing
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Block models for scheduling jobs on two parallel machines with a single server
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Online LPT algorithms for parallel machines scheduling with a single server
- Scheduling with multiple servers
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
- \(K\)-harmonic means data clustering with tabu-search method
- On-line scheduling of two parallel machines with a single server
- Parallel machine scheduling problems with a single server
- Parallel machine scheduling with multiple unloading servers
- Unrelated parallel machine scheduling using local search
- Rescheduling of identical parallel machines under machine eligibility constraints.
- Parallel machine scheduling with a common server
- A heuristic algorithm for minimizing mean flow time with unit setups
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- A tabu search algorithm for parallel machine total tardiness problem
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Future paths for integer programming and links to artificial intelligence
- Complexity results for parallel machine problems with a single server
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Parallel machine scheduling with tool loading
- Single-server parallel-machine scheduling with loading and unloading times
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Scheduling two parallel machines with a single server: the general case
- Minimizing Total Tardiness on One Machine is NP-Hard
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling for parallel dedicated machines with a single server
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
This page was built for publication: A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
