Job-shop scheduling in a body shop
From MaRDI portal
Publication:2434313
DOI10.1007/s10951-012-0300-2zbMath1280.90066MaRDI QIDQ2434313
Joachim Schauer, Cornelius Schwarz
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0300-2
Cites Work
- Unnamed Item
- Unnamed Item
- A job-shop problem with one additional resource type
- An efficient algorithm for the job-shop problem with two jobs
- One-machine generalized precedence constrained scheduling problems
- Scheduling chains on a single machine with non-negative time lags
- NP-hardness of shop-scheduling problems with three jobs
- Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Route Planning for Robot Systems
- On the Benefits of Using NP-hard Problems in Branch & Bound
- Scheduling