Pages that link to "Item:Q5305562"
From MaRDI portal
The following pages link to Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs (Q5305562):
Displaying 10 items.
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
- An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times (Q2931172) (← links)
- SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY (Q3174015) (← links)
- COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES (Q5411729) (← links)
