Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.

DOI10.1016/S0377-2217(02)00485-XzbMATH Open1033.90043MaRDI QIDQ1399596FDOQ1399596

Authors: Chandrasekharan Rajendran, Hans Ziegler

Publication date: 30 July 2003

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

Recommendations

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
A bicriteria scheduling with sequence-dependent setup times
A bicriteria flowshop scheduling problem with setup times
Scheduling jobs on parallel machines with sequence-dependent setup times

heuristics sequence-dependent setup times Scheduling flowshops

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

Title not available (Why is that?)
Optimal two- and three-stage production schedules with set-up time included
The Complexity of Flowshop and Jobshop Scheduling
A fast tabu search algorithm for the permutation flow-shop problem
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
Title not available (Why is that?)
A tabu search approach for the flow shop scheduling problem
A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
Modified simulated annealing algorithms for the flow shop sequencing problem
Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Scheduling with shutdowns and sequence dependent set-up times
A new heuristic method for the flow shop sequencing problem
A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
Two MILP models for the N × M SDST flowshop sequencing problem

Cited In (15)

Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines
A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
A bicriteria flowshop scheduling problem with setup times
Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
A survey of scheduling problems with setup times or costs
A bicriteria scheduling with sequence-dependent setup times
Modeling and analysis of multiobjective lot splitting for \(N\)-product \(M\)-machine flowshop lines
An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

This page was built for publication: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.

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