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

DOI10.1016/S0305-0548(02)00124-7zbMath1039.90017MaRDI QIDQ1422367

Ching-Fang Liaw

Publication date: 14 February 2004

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

zbMATH Keywords

Tabu searchSchedulingOpen shopTardiness

Mathematics Subject Classification ID

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

Related Items (2)

A study on open shop scheduling to minimise total tardiness ⋮ Applying tabu search to backup path planning for multicast networks

Uses Software

• Tabu search

Cites Work

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

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