Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
From MaRDI portal
Publication:1399596
DOI10.1016/S0377-2217(02)00485-XzbMath1033.90043MaRDI QIDQ1399596
Hans Ziegler, Chandrasekharan Rajendran
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, 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, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem, A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs, Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, A survey of scheduling problems with setup times or costs, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Modeling and analysis of multiobjective lot splitting for N -product M -machine flowshop lines, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines, A bicriteria scheduling with sequence-dependent setup times
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
- A fast tabu search algorithm for the permutation flow-shop problem
- A tabu search approach for the flow shop scheduling problem
- Two MILP models for the N × M SDST flowshop sequencing problem
- Optimal two- and three-stage production schedules with setup times included
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- The Complexity of Flowshop and Jobshop Scheduling
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Scheduling with shutdowns and sequence dependent set-up times
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
