Unbounded parallel batch scheduling with job delivery to minimize makespan

DOI10.1016/j.orl.2008.01.006zbMath1155.90390OpenAlexW1979128039MaRDI QIDQ1003499

Jinjiang Yuan, Ling-Fa Lu

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.01.006

zbMATH Keywords

heuristicparallel batch schedulingworst-case performance ratiojob delivery

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing ⋮ Integrated scheduling problem on a single bounded batch machine with an unavailability constraint ⋮ Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Unbounded parallel-batch scheduling with family jobs and delivery coordination ⋮ On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date 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 ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Scheduling a batching machine
• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• Single machine scheduling with batch deliveries
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• On scheduling an unbounded batch machine
• Machine scheduling with job delivery coordination
• Complex Scheduling
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Machine scheduling with transportation considerations

This page was built for publication: Unbounded parallel batch scheduling with job delivery to minimize makespan