The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
From MaRDI portal
Publication:596087
DOI10.1016/j.tcs.2004.01.038zbMath1067.90050OpenAlexW4246423696MaRDI QIDQ596087
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/630
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (19)
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Unbounded parallel-batch scheduling with family jobs and delivery coordination ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan ⋮ The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ The coordination of transportation and batching scheduling ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- 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
- Scheduling with batching: A review
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
This page was built for publication: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
