A greedy heuristic for the mean tardiness sequencing problem

DOI10.1016/0305-0548(94)90094-9zbMATH Open0796.90034OpenAlexW2093215438MaRDI QIDQ1317079FDOQ1317079

Authors: Adam Fadlalla, James R. Evans, Martin S. Levy 

Publication date: 26 September 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90094-9

Recommendations

• A heuristic for the single machine tardiness problem
• One machine scheduling to minimize expected mean tardiness. II
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• scientific article; zbMATH DE number 4085401

zbMATH Keywords

heuristicssingle processoraverage tardinessmean tardiness problemsequencing a set of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Minimizing Total Tardiness on One Machine is NP-Hard
• Title not available (Why is that?)
• Title not available (Why is that?)
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• An experimental comparison of solution algorithms for the single-machine tardiness problem

Cited In (11)

• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Improving the performance of enumerative search methods. II: Computational experiments
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms
• The single-machine total tardiness scheduling problem: review and extensions
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Title not available (Why is that?)
• A heuristic for the single machine tardiness problem
• A note on sequencing jobs with deadlines problem
• Average and worst-case analysis of heuristics for the maximum tardiness problem

This page was built for publication: A greedy heuristic for the mean tardiness sequencing problem

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