Rotation cycle schedulings for multi-item production systems

European Journal of Operational Research

Volumn 135, Issue 2, 2001, Pages 361-372

  Chan, Gin Hor ^a   Song, Yuyue ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Branch and bound algorithm; Rotation cycle; Travelling salesman

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SCHEDULING;

MULTI-ITEM PRODUCTION SYSTEMS;

TRAVELING SALESMAN PROBLEM;

EID: 0035546615     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00317-9     Document Type: Article

References (6)

1. The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes
2. Note: Dynamic lot sizing for a finite rate input process
3. On the general feasibility test for scheduling lot sizes for several products on one machine
4. When is the economic lot scheduling problem easy?
5. The traveling salesman problem