A job-shop problem with one additional resource type

Authors:
Alessandro Agnetis;Marta Flamini;Gaia Nicosia;Andrea Pacifici
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Siena, Siena, Italy 53100;Data Management S.P.A., Roma, Italy 00128;Dipartimento di Informatica e Automazione, Università Roma Tre, Roma, Italy 00146;Dipartimento di Ingegneria dell'Impresa, Università di Roma Tor Vergata, Roma, Italy 00133
Venue:
Journal of Scheduling
Year:
2011

Citing 8
Cited 3

An efficient algorithm for the job-shop problem with two jobs

Computing
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
NP-hardness of shop-scheduling problems with three jobs

Discrete Applied Mathematics
One-operator–two-machine flowshop scheduling with setup and dismounting times

Computers and Operations Research
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling problems for parallel dedicated machines under multiple resource constraints

Discrete Applied Mathematics - International symposium on combinatorial optimisation

Genetic algorithm for job-shop scheduling with operators

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Optimally scheduling a job-shop with operators and total flow time minimization

CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Job-shop scheduling in a body shop

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a job-shop scheduling problem with n jobs and the constraint that at most pn jobs can be processed simultaneously. This model arises in several manufacturing processes, where each operation has to be assisted by one human operator and there are p (versatile) operators. The problem is binary NP-hard even with n=3 and p=2. When the number of jobs is fixed, we give a pseudopolynomial dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS). We also propose an enumeration scheme based on a generalized disjunctive graph, and a dynamic programming-based heuristic algorithm. The results of an extensive computational study for the case with n=3 and p=2 are presented.