A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

DOI10.1016/j.ejor.2004.07.020zbMath1154.90499OpenAlexW1989396603MaRDI QIDQ2566710

T. K. Varadharajan, Chandrasekharan Rajendran

Publication date: 28 September 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.020

zbMATH Keywords

Simulated annealingMakespanFlowshop schedulingMultiple objectivesTotal flowtime

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (20)

A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics ⋮ Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Multi-directional local search ⋮ Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Robust university course timetabling problem subject to single and multiple disruptions ⋮ Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A new heuristic method for the flow shop sequencing problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• Flowshop sequencing with mean flowtime objective
• Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
• A tabu search approach for the flow shop scheduling problem
• Heuristics for scheduling in flowshop with multiple objectives
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Benchmarks for basic scheduling problems
• Performance of the MOSA method for the bicriteria assignment problem
• Multicriteria scheduling problems: a survey
• Optimal two- and three-stage production schedules with setup times included
• ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
• AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

This page was built for publication: A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs