Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing

DOI10.1016/j.cor.2020.105126OpenAlexW3096227837MaRDI QIDQ2026991

Liji Shen, Lars Mönch

Publication date: 21 May 2021

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

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

zbMATH Keywords

computational experimentsGRASPparallel machine schedulingdelivery timesdistributed manufacturing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (5)

Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ The due date assignment scheduling problem with the deteriorating jobs and delivery time ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem

Uses Software

• GALib

Cites Work

• Unnamed Item
• Unnamed Item
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• A GRASP based on DE to solve single machine scheduling problem with SDST
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
• Online batch scheduling on parallel machines with delivery 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 on parallel machines with sequence-dependent setup times
• Scheduling identical parallel machines to minimize total weighted completion time
• Heuristics for parallel machine scheduling with delivery times
• Scheduling on uniform parallel machines to minimize maximum lateness
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Machine scheduling with job delivery coordination
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• A GRASP for Parallel Machine Scheduling with Time Windows
• Optimization by GRASP
• Parallel Greedy Randomized Adaptive Search Procedures
• Machine scheduling with an availability constraint and job delivery coordination
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Scheduling independent tasks to reduce mean finishing time
• Machine scheduling with transportation considerations
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time

This page was built for publication: Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing