Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
From MaRDI portal
(Redirected from Publication:1399596)
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
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- A fast tabu search algorithm for the permutation flow-shop problem
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A new heuristic method for the flow shop sequencing problem
- A tabu search approach for the flow shop scheduling problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Optimal two- and three-stage production schedules with set-up time included
- 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
- The Complexity of Flowshop and Jobshop Scheduling
- Two MILP models for the N × M SDST flowshop sequencing problem
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Cited in
(16)- Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
- 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
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- 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)
