Pages that link to "Item:Q1876177"
From MaRDI portal
The following pages link to A new rule for minimizing the number of tardy jobs in dynamic flow shops (Q1876177):
Displaying 16 items.
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
- A note on the flow time and the number of tardy jobs in stochastic open shops (Q796445) (← links)
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- The job shop tardiness problem: A corrected model (Q1342655) (← links)
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
- Improving delivery reliability by a new due-date setting rule (Q2426550) (← links)
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
- A dynamic forecasting model for job shop flowtime prediction and tardiness control (Q4398975) (← links)
- Using dispatching rules for job shop scheduling with due date-based objectives (Q5444509) (← links)
- Heuristics for flow shop rescheduling with mixed blocking constraints (Q6592920) (← links)
