A job-shop problem with one additional resource type
From MaRDI portal
Publication:640303
DOI10.1007/S10951-010-0162-4zbMATH Open1222.90012OpenAlexW2159739923MaRDI QIDQ640303FDOQ640303
Authors: Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici
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
Recommendations
- scientific article; zbMATH DE number 3887411
- scientific article; zbMATH DE number 4099024
- scientific article; zbMATH DE number 3882186
- Job Shop Scheduling under a Non-Renewable Resource Constraint
- Publication:4724419
- A preemptive open shop scheduling problem with one resource
- Flexible job-shop scheduling problem under resource constraints
- scientific article; zbMATH DE number 3976751
- Job-shop scheduling with resource-time models of operations
- Solving an integrated job-shop problem with human resource constraints
Cites Work
- Title not available (Why is that?)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- A Theorem on Boolean Matrices
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- NP-hardness of shop-scheduling problems with three jobs
- The one-machine sequencing problem
- Complexity results for flow-shop problems with a single server
- Scheduling for parallel dedicated machines with a single server
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Scheduling parallel dedicated machines under a single non-shared resource
- Title not available (Why is that?)
- An efficient algorithm for the job-shop problem with two jobs
- Scheduling three chains on two parallel machines
- Minimizing makespan in a pallet-constrained flowshop
- One-operator-two-machine flowshop scheduling with setup and dismounting times
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
- The Machine Duplication Problem in a Job Shop with Two Jobs
Cited In (7)
- A flexible job shop scheduling approach with operators for coal export terminals
- Job-shop scheduling in a body shop
- Parallel dedicated machines scheduling with chain precedence constraints
- A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach
- Title not available (Why is that?)
- Optimization of the integrated problem of employee timetabling and job shop scheduling
- Depth-first heuristic search for the job shop scheduling problem
This page was built for publication: A job-shop problem with one additional resource type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640303)