A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
From MaRDI portal
Publication:4398985
DOI10.1080/00207549508930220zbMATH Open0909.90185OpenAlexW2065482755MaRDI QIDQ4398985FDOQ4398985
Kenji Itoh, Takao Enkawa, Seyed Hessameddin Zegordi
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
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
- 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
- Focused Scheduling in Proportionate Flowshops
- The Single Machine Early/Tardy Problem
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Minimizing mean absolute deviation of completion times about a common due date
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
Cited In (11)
- 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
- Title not available (Why is that?)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Multicriteria scheduling problems: a survey
- Metaheuristics: A bibliography
- Simulated annealing algorithm for solving the single machine early/tardy problem
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- Counting and enumeration complexity with application to multicriteria scheduling
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)
