Pages that link to "Item:Q1127155"
From MaRDI portal
The following pages link to Minimizing total tardiness in permutation flowshops (Q1127155):
Displayed 16 items.
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
- Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness (Q1011327) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
- A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q5431617) (← links)