Unbounded parallel batch scheduling with job delivery to minimize makespan

DOI10.1016/J.ORL.2008.01.006MaRDI QIDQ1003499zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Lingfa 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

heuristicjob deliveryparallel batch schedulingworst-case performance ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Online unbounded batch scheduling on parallel machines with delivery times
• Heuristics for parallel machine scheduling with batch delivery consideration

Cites work

• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• Complex Scheduling
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 563208 (Why is no real title available?)
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• On scheduling an unbounded batch machine
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Scheduling a batching machine
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Single machine scheduling with batch deliveries

Cited in

(18)

• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
• Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
• Approximating bounded job start scheduling with application in Royal Mail deliveries under uncertainty
• Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
• Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing
• Heuristics for parallel machine scheduling with batch delivery consideration
• Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations
• Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
• An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003499)