A job-shop problem with one additional resource type

DOI10.1007/s10951-010-0162-4zbMath1222.90012MaRDI QIDQ640303

Gaia Nicosia, Alessandro Agnetis, Andrea Pacifici, Marta Flamini

Publication date: 18 October 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0162-4

zbMATH Keywords

dynamic programming; job shop; disjunctive graph; scheduling with resource constraints

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

Depth-first heuristic search for the job shop scheduling problem, Parallel dedicated machines scheduling with chain precedence constraints, Job-shop scheduling in a body shop

Cites Work

• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Scheduling three chains on two parallel machines
• An efficient algorithm for the job-shop problem with two jobs
• The one-machine sequencing problem
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Minimizing makespan in a pallet-constrained flowshop
• One-operator-two-machine flowshop scheduling with setup and dismounting times
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Complexity results for flow-shop problems with a single server
• Scheduling parallel dedicated machines under a single non-shared resource
• NP-hardness of shop-scheduling problems with three jobs
• One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
• The Machine Duplication Problem in a Job Shop with Two Jobs
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item