Effective job shop scheduling through active chain manipulation

DOI10.1016/0305-0548(94)E0018-3zbMath0812.90072MaRDI QIDQ1342330

Dake Sun, Rajan Batta, Li Lin

Publication date: 15 May 1995

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

zbMATH Keywords

tabu searchheuristic algorithmmakespan reduction job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A fast finite loading algorithm for job oriented scheduling ⋮ Metaheuristics: A bibliography ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Performance enhancements to tabu search for the early/tardy scheduling problem ⋮ The hot strip mill production scheduling problem: A tabu search approach

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Future paths for integer programming and links to artificial intelligence
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• A Computational Study of the Job-Shop Scheduling Problem
• Job-Shop Scheduling by Implicit Enumeration
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: Effective job shop scheduling through active chain manipulation