Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations

DOI10.1016/J.COR.2024.106638MaRDI QIDQ6568449zbMATH OpenFDO

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)

zbMATH Keywords

parallel machine schedulingsingle servermixed-integer linear programgeneral variable neighborhood searchloading operationsunloading operations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 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
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
• Block models for scheduling jobs on two parallel machines with a single server
• Greedy randomized adaptive search procedures
• Heuristics for the two-machine scheduling problem with a single server
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
• Minimizing the makespan on two identical parallel machines with mold constraints
• Nested general variable neighborhood search for the periodic maintenance problem
• On the facial structure of scheduling polyhedra
• Online algorithms for scheduling two parallel machines with a single server
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with a single server: loading and unloading
• Parallel machine scheduling with multiple unloading servers
• Scheduling on two parallel machines with two dedicated servers
• Scheduling two parallel machines with a single server: the general case
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• Scheduling with multiple servers
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Single-server parallel-machine scheduling with loading and unloading times
• The significance of reducing setup times/setup costs
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Variable neighborhood search
• Variable neighborhood search: basics and variants
• 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)