A heuristic for scheduling general job shops to minimize maximum lateness

DOI10.1016/S0895-7177(97)00250-1zbMath1185.90095OpenAlexW1982404543MaRDI QIDQ969764

B. E. Eshmatov

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00250-1

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises

Uses Software

• JOBSHOP

Cites Work

• Adjustment of heads and tails for the job-shop problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• Job-Shop Scheduling by Implicit Enumeration
• A modified shifting bottleneck procedure for job-shop scheduling

This page was built for publication: A heuristic for scheduling general job shops to minimize maximum lateness