Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
From MaRDI portal
Publication:6568449
DOI10.1016/J.COR.2024.106638MaRDI QIDQ6568449FDOQ6568449
Authors: Abdelhak Elidrissi, R. Ben-Mansour, Keramat Hasani, Frank Werner 
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
parallel machine schedulingsingle servermixed-integer linear programgeneral variable neighborhood searchloading operationsunloading operations
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A time indexed formulation of non-preemptive single machine scheduling problems
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- The significance of reducing setup times/setup costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Single-server parallel-machine scheduling with loading and unloading times
- Parallel machine scheduling problems with a single server
- Parallel machine scheduling with multiple unloading servers
- Nested general variable neighborhood search for the periodic maintenance problem
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Scheduling two parallel machines with a single server: the general case
- Block models for scheduling jobs on two parallel machines with a single server
- Scheduling with multiple servers
- On the facial structure of scheduling polyhedra
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Heuristics for the two-machine scheduling problem with a single server
- Scheduling on two parallel machines with two dedicated servers
- 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
- Variable neighborhood search: basics and variants
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Online algorithms for scheduling two parallel machines with a single server
- Minimizing the makespan on two identical parallel machines with mold constraints
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
- Parallel machine scheduling with a single server: loading and unloading
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568449)
