A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem

DOI10.1080/00207549508930220MaRDI QIDQ4398985zbMATH OpenOpenAlexFDO

Authors Seyed Hessameddin Zegordi, Kenji Itoh, Takao Enkawa

Publication date 3 December 1998

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207549508930220

zbMATH Keywords

simulated annealingflow shop schedulingearly/tardy costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• scientific article; zbMATH DE number 6263695
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Simulated annealing algorithm for solving the single machine early/tardy problem

Cites work

• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• An improved annealing scheme for the QAP
• Focused Scheduling in Proportionate Flowshops
• Minimizing mean absolute deviation of completion times about a common due date
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
• The Single Machine Early/Tardy Problem
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Using simulated annealing to solve routing and location problems

Cited in

(11)

• Counting and enumeration complexity with application to multicriteria scheduling
• A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
• scientific article; zbMATH DE number 6263695 (Why is no real title available?)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
• Multicriteria scheduling problems: a survey
• Metaheuristics: A bibliography
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• Simulated annealing algorithm for solving the single machine early/tardy problem

This page was built for publication: A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem

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