Scheduling problems on parallel identical unbounded batch processing machines

MaRDI QIDQ4980787zbMATH OpenFDO

Authors Lili Liu, Feng Zhang

Publication date 30 June 2014

zbMATH Keywords

schedulingrelease datebatch processing machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Scheduling jobs with release dates on parallel batch processing machines
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Computing and Combinatorics
• Batching identical jobs

Cited in

(19)

• scientific article; zbMATH DE number 6501083 (Why is no real title available?)
• Computing and Combinatorics
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• On scheduling an unbounded batch machine
• Efficient scheduling algorithms for a single batch processing machine
• Algorithmic Applications in Management
• Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
• Batching identical jobs
• Scheduling an unbounded batching machine with job processing time compatibilities
• Single machine parallel-batch scheduling with release dates and machine availability constraints
• Identical parallel machine scheduling problem with release dates and the change of the number of machines
• Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
• A note on unbounded parallel-batch scheduling
• Modelling and scheduling a batch-type production on identical machines
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Unbounded parallel-batch scheduling with drop-line tasks
• Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
• Optimal batch schedules for parallel machines

This page was built for publication: Scheduling problems on parallel identical unbounded batch processing machines

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