A new heuristic algorithm for the machine scheduling problem with job delivery coordination

DOI10.1016/j.tcs.2009.02.019zbMath1172.90005OpenAlexW2015643954MaRDI QIDQ1029329

Jason Chao-Hsien Pan, Chi-Shiang Su, Tsung-Shin Hsu

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.019

zbMATH Keywords

schedulingheuristicsupply chain managementcomplexity theory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (17)

An improved two-machine flowshop scheduling with intermediate transportation ⋮ Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ Heuristics for parallel machine scheduling with batch delivery consideration ⋮ Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ An improved approximation algorithm for a scheduling problem with transporter coordination ⋮ PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ 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 ⋮ Two parallel machines scheduling with two-vehicle job delivery to minimize makespan ⋮ 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 ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
• Single machine scheduling with batch deliveries
• Heuristics for parallel machine scheduling with delivery times
• Machine scheduling with job delivery coordination
• Complexity of flow shop scheduling problems with transportation constraints
• Scheduling with batching: A review
• Fast Approximation Algorithms for Knapsack Problems
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Machine scheduling with transportation considerations

This page was built for publication: A new heuristic algorithm for the machine scheduling problem with job delivery coordination