Heuristics for parallel machine scheduling with delivery times
From MaRDI portal
Publication:1338896
DOI10.1007/BF01213203zbMath0818.68040OpenAlexW2007044196MaRDI QIDQ1338896
Publication date: 23 November 1994
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01213203
heuristicsworst-case analysisidentical parallel machinesdelivery timeparallel machine scheduling problem
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Machine scheduling with job delivery coordination ⋮ Parallel machine scheduling with batch delivery to two customers ⋮ Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Coordinating multi-location production and customer delivery ⋮ An improved approximation algorithm for a scheduling problem with transporter coordination ⋮ Machine scheduling with transportation considerations ⋮ Integrated production and delivery scheduling on a serial batch machine to minimize the makespan ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Parallel machine scheduling with nested processing set restrictions and job delivery times ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ A new heuristic algorithm for the machine scheduling problem with job delivery coordination ⋮ Scheduling installations in the telecommunications industry ⋮ A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ Two parallel machines problem with job delivery coordination and availability constraint ⋮ Online scheduling on two parallel machines with release dates and delivery times
Cites Work
- Unnamed Item
- Geometric complexity of some location problems
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Worst-Case Analysis of Heuristic Algorithms
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Performance Guarantees for Scheduling Algorithms
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
