An integrated greedy heuristic for a flexible job shop scheduling problem

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

Volumn 4, Issue , 2001, Pages 2534-2539

  Mati, Yazid ^a   Rezg, Nidhal ^a   Xie, Xiaolan ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Flexibility; Geometric approach; Job shop; Manufacturing systems; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MANUFACTURE; OPTIMIZATION;

GEOMETRIC APPROACH; JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0035719796     PISSN: 08843627     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICSMC.2001.972939     Document Type: Article

References (13)

1. A non-numerical approach to production scheduling problems
2. The job shop scheduling problem: Conventional and new solution techniques
3. Routing and scheduling in a flexible job shop by tabu search
4. An efficient algorithm for the job-shop problem with two jobs
5. Job-shop scheduling with multi-purpose machines
6. An integrated approach for modeling and solving the multiprocessor job-shop scheduling problem using tabu search
7. Multi-resource shop scheduling with resource flexibility
8. Tabu search for the job-shop scheduling problem with multi-purpose machines
9. Deterministic job-shop scheduling: Past present and future
10. Geometric approach and taboo search for scheduling flexible manufacturing systems
11. The complexity of the two-job shop scheduling problems with resource flexibility
12. A hierarchical approach for the FMS scheduling problem