Single machine parallel batch scheduling subject to precedence constraints
From MaRDI portal
Publication:4651725
DOI10.1002/nav.20035zbMath1055.90034OpenAlexW1997445858MaRDI QIDQ4651725
No author found.
Publication date: 22 February 2005
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20035
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (14)
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines ⋮ Approximability results for the resource-constrained project scheduling problem with a single type of resources ⋮ Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ On lower and upper bounds for single machine parallel batch scheduling ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
This page was built for publication: Single machine parallel batch scheduling subject to precedence constraints
