Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

DOI10.1016/j.cor.2003.09.001zbMath1071.90528OpenAlexW1969218542MaRDI QIDQ707000

Aifeng Yang, Cheng, T. C. Edwin, Jinjiang Yuan

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/654

zbMATH Keywords

AlgorithmsSchedulingRelease datesBatch processingIdentical processing timesPrecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (10)

A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ The lockmaster's problem ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints ⋮ Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan ⋮ Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times

Cites Work

• Scheduling a batching machine
• Lower bounds for resource-constrained project scheduling problems.
• Scheduling one batch processor subject to job release dates
• On scheduling an unbounded batch machine
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times