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

DOI10.1016/S0305-0548(02)00124-7zbMATH Open1039.90017MaRDI QIDQ1422367FDOQ1422367

Authors: Ching-Fang Liaw 

Publication date: 14 February 2004

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

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

zbMATH Keywords

SchedulingOpen shopTabu searchTardiness

Mathematics Subject Classification ID

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

Cites Work

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

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

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)