Optimizing Bicriteria Flow Shop Scheduling Problem by Simulated Annealing Algorithm
Authors:
- Pempera JarosławPJPempera Jarosław
- Smutnicki CzesławSCSmutnicki Czesław
- Żelazny DominikŻDŻelazny Dominik
Open Access
- 1 January 2013
- journal article
- Published by Elsevier in Procedia Computer Science
- Vol. 18, 936-945
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjectiveComputers & Operations Research, 2011
- A multi-objective production scheduling case study solved by simulated annealingEuropean Journal of Operational Research, 2007
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobsEuropean Journal of Operational Research, 2005
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode versionEuropean Journal of Operational Research, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimizationProduction Planning & Control, 1999
- Multi-objective genetic algorithm and its applications to flowshop schedulingComputers & Industrial Engineering, 1996
- Optimization by Simulated AnnealingScience, 1983
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983