Integer Programming and Combinatorial Optimization

DOI10.1007/B97946zbMATH Open1092.90514OpenAlexW2484779063MaRDI QIDQ5712461

José Correa, Andreas S. Schulz

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Single machine, scheduling problem with fuzzy precedence relation ⋮ Parametric precedence relations in single machine scheduling ⋮ Title not available (Why is that?) ⋮ single Machine Preemptive Scheduling With Special Cost Functions¹ ⋮ Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria ⋮ Single machine precedence constrained scheduling is a Vertex cover problem

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Single-machine scheduling with precedence constraints and position-dependent processing times 👍 👎
• Single machine scheduling with precedence constraints and positionally dependent processing times 👍 👎
• Single-machine scheduling problems with precedence constraints and simple linear deterioration 👍 👎
• Single machine scheduling subject to precedence delays 👍 👎
• Single Machine Scheduling with Series-Parallel Precedence Constraints 👍 👎
• Single-Machine Scheduling Polyhedra with Precedence Constraints 👍 👎
• Single-Machine Scheduling with Precedence Constraints 👍 👎

This page was built for publication: Integer Programming and Combinatorial Optimization

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