A heuristic to schedule flexible job-shop in a glass factory

DOI10.1016/j.ejor.2004.04.020zbMath1066.90538MaRDI QIDQ1772853

Xianqiang Yang

Publication date: 21 April 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.020

zbMATH Keywords

Heuristics; Scheduling; Production; Job shop; Overlapping; Operation synchronization

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

90B90: Case-oriented studies in operations research

Cites Work

• Extending the shifting bottleneck procedure to real-life applications
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Approximative procedures for no-wait job shop scheduling.
• Project scheduling. A research handbook.
• Sequencing of jobs in some production system
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
• A comparative study of dispatching rules in dynamic flowshops and jobshops
• Job-shop scheduling with blocking and no-wait constraints
• A mathematical programming model for scheduling steelmaking-continuous casting production
• Routing and scheduling in a flexible job shop by tabu search
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry