One-machine generalized precedence constrained scheduling problems

Authors:
Erick D. Wikum;Donna C. Llewellyn;George L. Nemhauser
Affiliations:
School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
1994

Citing 1
Cited 7

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A memetic algorithm for the job-shop with time-lags

Computers and Operations Research
Generalized disjunctive constraint propagation for solving the job shop problem with time lags

Engineering Applications of Artificial Intelligence
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Operations Research Letters
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay

Operations Research Letters
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

Journal of Mathematical Modelling and Algorithms
Scheduling coupled-operation jobs with exact time-lags

Discrete Applied Mathematics
Job-shop scheduling in a body shop

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate one-machine scheduling problems subject to generalized precedence constraints which specify that when job J"j precedes job J"j"' (denoted by J"j-J"j"'), the time between the end J"j and the beginning of job J"j"' must be at least l"j"j"', but no more than u"j"j"', where 0=