METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM

DOI10.1142/S0217595904000072zbMath1056.90071OpenAlexW2068044149MaRDI QIDQ4650620

No author found.

Publication date: 18 February 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595904000072

zbMATH Keywords

metaheuristicsopen shopjob shopmixed shopMachine scheduling

Mathematics Subject Classification ID

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

Related Items (8)

An effective heuristic algorithm for the partial shop scheduling problem ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Optimising a coal rail network under capacity constraints ⋮ APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM ⋮ Triage Scheduling Optimization for Mass Casualty and Disaster Response ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem

Cites Work

• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The mixed shop scheduling problem
• A tabu search algorithm for the open shop scheduling problem
• Future paths for integer programming and links to artificial intelligence
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Complexity of mixed shop scheduling problems: A survey
• Applying tabu search to the job-shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Two-Machine Super-Shop Scheduling Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM