Using tabu search to solve the common due date early/tardy machine scheduling problem

DOI10.1016/S0305-0548(96)00052-4MaRDI QIDQ1373879zbMATH OpenOpenAlexFDO

Authors Ross J. W. James

Publication date 22 June 1998

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

Full work available at URL https://doi.org/10.1016/s0305-0548(96)00052-4

zbMATH Keywords

tabu searchrestricted, common-due-date, early/tardy machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Performance enhancements to tabu search for the early/tardy scheduling problem
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A tabu search approach for the single machine mean tardiness problem
• A tabu search approach to machine scheduling
• A tabu search algorithm for parallel machine total tardiness problem

Cites work

• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A tabu search experience in production scheduling
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• Common due-date determination and sequencing using tabu search
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Future paths for integer programming and links to artificial intelligence
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu Search—Part I

Cited in

(10)

• A differential evolution approach for the common due date early/tardy job scheduling problem
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Self-adaptive biased differential evolution for scheduling against common due dates
• Reducing tardy jobs by integrating process planning and scheduling functions
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• A heuristic approach to bicriteria scheduling
• Performance enhancements to tabu search for the early/tardy scheduling problem
• Multiple machine JIT scheduling: a tabu search approach

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Using tabu search to solve the common due date early/tardy machine scheduling problem

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