Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

DOI10.1016/j.cor.2022.105999OpenAlexW4295136156MaRDI QIDQ2108098

Söhnke Maecker, Liji Shen, Lars Mönch

Publication date: 19 December 2022

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

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105999

zbMATH Keywords

mixed integer linear programmingvariable neighborhood searchparallel machine schedulingtotal weighted tardinessdelivery times

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Gurobi

Cites Work

• Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• New results on single-machine scheduling with past-sequence-dependent delivery times
• An improved approximation algorithm for single machine scheduling with job delivery
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• Machine scheduling with deliveries to multiple customer locations
• Scheduling on parallel identical machines to minimize total tardiness
• Improved algorithms for two single machine scheduling problems
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• On the machine scheduling problem with job delivery coordination
• Variable neighbourhood search: methods and applications
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• Unbounded parallel batch scheduling with job delivery to minimize makespan
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• A heuristic for the single machine tardiness problem
• Heuristics for parallel machine scheduling with delivery times
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Variable neighborhood search
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Minimizing makespan on parallel machines subject to release dates and delivery times
• 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
• Scheduling with job delivery coordination on single machine
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
• A decomposition algorithm for the single machine total tardiness problem
• Machine scheduling with job delivery coordination
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
• Theoretical and practical issues in single-machine scheduling with two job release and delivery times
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• Parallel machine scheduling with machine availability and eligibility constraints
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• Unrelated parallel machine scheduling with new criteria: complexity and models
• Machine scheduling with an availability constraint and job delivery coordination
• SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
• New Precedence Theorems for One-Machine Weighted Tardiness
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Scheduling
• Machine scheduling with transportation considerations
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
• Unnamed Item

This page was built for publication: Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness