Heuristics for scheduling in flowshop with multiple objectives

From MaRDI portal
Publication:1388918

DOI10.1016/0377-2217(93)E0212-GzbMath0905.90107MaRDI QIDQ1388918

Chandrasekharan Rajendran

Publication date: 2 February 1999

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




Related Items

A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtimeA hybrid neural network–genetic algorithm approach for permutation flow shop schedulingSolving multi-objective production scheduling problems using metaheuristicsAn exact parallel method for a bi-objective permutation flowshop problemAn improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problemAnt-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assemblyA bicriteria flowshop scheduling with a learning effectMinimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithmMulticriteria scheduling problems: a surveyScheduling in flowshops to minimize total tardiness of jobsA new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardinessWorkload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case studyA multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteriaFlowshop-scheduling problems with makespan criterion: a reviewA bicriteria approach to the two-machine flow shop scheduling problemAnalytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variabilityGenetic local search for multi-objective flowshop scheduling problemsA multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobsA bicriteria two-machine permutation flowshop problemSome results of the worst-case analysis for flow shop schedulingEfficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisationApproximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion timeThe two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime



Cites Work