An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.

DOI10.1016/S0305-0548(02)00124-7MaRDI QIDQ1422367zbMATH OpenFDO

Authors Ching-Fang Liaw

Publication date 14 February 2004

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

SchedulingOpen shopTabu searchTardiness

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling preemptive open shops to minimize total tardiness
• Scheduling two-machine preemptive open shops to minimize total completion time
• A tabu search algorithm for the open shop problem
• A tabu search algorithm for the open shop scheduling problem
• A tabu search approach for proportionate multiprocessor open shop scheduling

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 1016767 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• A Note on Open Shop Preemptive Schedules
• A branch \(\&\) bound algorithm for the open-shop problem
• A dual algorithm for the one-machine scheduling problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• Future paths for integer programming and links to artificial intelligence
• Massively parallel tabu search for the quadratic assignment problem
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Minimizing Total Tardiness on One Machine is NP-Hard
• On the complexity of preemptive open-shop scheduling problems
• On the complexity of preemptive openshop scheduling problems
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling ordered open shops
• Scheduling the Open Shop to Minimize Mean Flow Time
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(4)

• Applying tabu search to backup path planning for multicast networks
• Scheduling preemptive open shops to minimize total tardiness
• Scheduling two-machine preemptive open shops to minimize total completion time
• A study on open shop scheduling to minimise total tardiness

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422367)