An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

DOI10.1016/0377-2217(94)00361-0zbMath0947.90582OpenAlexW2017644174MaRDI QIDQ1278192

Andy Tiger, Taeyong Yang, Zesheng He

Publication date: 8 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00361-0

zbMATH Keywords

simulated annealingjob shop schedulingsequencingheuristicscheduling with due dates

Mathematics Subject Classification ID

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

Related Items

Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ A review of some issues and identification of some barriers in the implementation of FMS ⋮ Modelling and heuristics of FMS scheduling with multiple objectives

Cites Work

• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Simulated annealing: A tool for operational research
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• Simulated annealing for resource-constrained scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Job Shop Scheduling by Simulated Annealing
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• A Simulation Study of Predictable Due-Dates