Pages that link to "Item:Q2666692"
From MaRDI portal
The following pages link to Resource allocation flowshop scheduling with learning effect and slack due window assignment (Q2666692):
Displaying 17 items.
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads (Q2097458) (← links)
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects (Q2678845) (← links)
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
- Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect (Q2691291) (← links)
- Study on resource allocation scheduling problem with learning factors and group technology (Q2691328) (← links)
- Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects (Q5024914) (← links)
- Slack due window assignment scheduling in the single-machine with controllable processing times (Q6065132) (← links)
- Due-window assignment scheduling with job-rejection, truncated learning effects and setup times (Q6086971) (← links)
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times (Q6102896) (← links)
- Single machine slack due window assignment and deteriorating jobs (Q6149338) (← links)
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment (Q6535663) (← links)
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs (Q6542459) (← links)
- Study on due-date assignment scheduling with setup times and general truncated learning effects (Q6561566) (← links)
- Supply chain scheduling with deteriorating jobs and delivery times (Q6584776) (← links)
- Permutation flow shop scheduling with makespan objective and truncated learning effects (Q6586108) (← links)
- A note: minmax due-window assignment with fixed earliness-tardiness costs (Q6593204) (← links)
- Research on delivery times scheduling with sum of logarithm processing times-based learning effect (Q6635991) (← links)