Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
From MaRDI portal
Publication:2108098
DOI10.1016/J.COR.2022.105999OpenAlexW4295136156MaRDI QIDQ2108098FDOQ2108098
Authors: 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
Recommendations
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- 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
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
mixed integer linear programmingvariable neighborhood searchparallel machine schedulingtotal weighted tardinessdelivery times
Cites Work
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Heuristics for parallel machine scheduling with delivery times
- Machine scheduling with job delivery coordination
- Machine scheduling with an availability constraint and job delivery coordination
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Machine scheduling with transportation considerations
- Machine scheduling with deliveries to multiple customer locations
- Improved algorithms for two single machine scheduling problems
- On the machine scheduling problem with job delivery coordination
- Title not available (Why is that?)
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Scheduling on parallel identical machines to minimize total tardiness
- A heuristic for the single machine tardiness problem
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- A decomposition algorithm for the single machine total tardiness problem
- Parallel machine scheduling with machine availability and eligibility constraints
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- New Precedence Theorems for One-Machine Weighted Tardiness
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Unrelated parallel machine scheduling with new criteria: complexity and models
- New results on single-machine scheduling with past-sequence-dependent delivery times
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- An improved approximation algorithm for single machine scheduling with job delivery
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Scheduling with job delivery coordination on single machine
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
- ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES
- Scheduling
- 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
- 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
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
Cited In (4)
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
Uses Software
This page was built for publication: Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108098)
