A heuristic for scheduling general job shops to minimize maximum lateness

DOI10.1016/S0895-7177(97)00250-1zbMATH Open1185.90095OpenAlexW1982404543MaRDI QIDQ969764FDOQ969764

Authors: 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

Recommendations

• The optimal algorithm of a generalized scheduling problem to minimize the number of late jobs
• Heuristics for minimizing total weighted tardiness in complex job shops
• Scheduling shops to minimize the weighted number of late jobs
• Scheduling job shop problems with operators with respect to the maximum lateness
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Scheduling in flowshops to minimize total tardiness of jobs
• Minimizing late jobs in the general one machine scheduling problem
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
• scientific article; zbMATH DE number 1271322

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Heuristics for minimizing total weighted tardiness in complex job shops
• Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
• Theoretical expectation versus practical performance of Jackson's heuristic
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• A job shop scheduling heuristic for varying reward structures
• Title not available (Why is that?)

Uses Software

• JOBSHOP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969764)