Minimizing total tardiness in permutation flowshops
From MaRDI portal
Publication:1127155
DOI10.1016/0377-2217(94)00029-CzbMATH Open0912.90174OpenAlexW1987255189MaRDI QIDQ1127155FDOQ1127155
Authors: Yeong-Dae Kim 
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00029-c
Recommendations
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Permutation flow shops with exact time lags to minimise maximum lateness
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Minimizing total tardiness in no-wait flowshops
- Permutation flowshop scheduling problems with maximal and minimal time lags
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Scheduling in flowshops to minimize total tardiness of jobs
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- The Lessons of Flowshop Scheduling Research
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Title not available (Why is that?)
- The two-machine flowshop scheduling problem with total tardiness
- A decomposition algorithm for the single machine total tardiness problem
- Focused Scheduling in Proportionate Flowshops
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
- An adaptive branching rule for the permutation flow-shop problem
- Generating improved dominance conditions for the flowshop problem
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- A new integer programming formulation for the permutation flowshop problem
- An Ordered Flow Shop Sequeneing Problem With TWK Type Due Dates and Total Tardiness Criterion
Cited In (40)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
- Scheduling in flowshops to minimize total tardiness of jobs
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
- Permutation flow shop scheduling with earliness and tardiness penalties
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Polynomial time algorithms for the UET permutation flowshop problem with time delays
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- An exact parallel method for a bi-objective permutation flowshop problem
- A single-objective heuristic algorithm subject to a given upper bound of maximum tardiness
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Title not available (Why is that?)
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- A parallel multiple reference point approach for multi-objective optimization
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- Scheduling on parallel identical machines to minimize total tardiness
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- New heuristics for total tardiness minimization in a flexible flowshop
- Minimizing total tardiness in no-wait flowshops
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Permutation flow shops with exact time lags to minimise maximum lateness
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
This page was built for publication: Minimizing total tardiness in permutation flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127155)
