A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

Operations Research Letters

Volumn 30, Issue 1, 2002, Pages 66-68

  Ng, C T ^a   Cheng, T C E ^a   Yuana, J J ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Batches; Due dates; Maximum lateness; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; SCHEDULING;

SERIAL BATCHING;

OPERATIONS RESEARCH;

EID: 0036477814     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00105-5     Document Type: Article

References (5)

1. The complexity of one-machine batching problems
2. Batch sizing and sequencing on a single machine
3. Complexity of machine scheduling problems
4. Scheduling groups of jobs on a single machine