Pages that link to "Item:Q547127"
From MaRDI portal
The following pages link to Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127):
Displayed 18 items.
- Single-machine bicriterion group scheduling with deteriorating setup times and job processing times (Q279548) (← links)
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Patient scheduling with periodic deteriorating maintenance on single medical device (Q342021) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
- Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
- Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity (Q1634141) (← links)
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time (Q1730624) (← links)
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q1791483) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop (Q2241320) (← links)
- Single-machine scheduling with accelerating deterioration effects (Q2448137) (← links)
- Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times (Q2788530) (← links)
- Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (Q2788531) (← links)
- A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129) (← links)
- MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (Q2873830) (← links)