Pages that link to "Item:Q1000973"

The following pages link to Minmax scheduling problems with a common due-window (Q1000973):

Displaying 14 items.

• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
• Optimization for due-window assignment scheduling with position-dependent weights (Q2195512) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
• Minmax scheduling problems with common due-date and completion time penalty (Q2424794) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
• Scheduling problems with a common due window assignment: A survey (Q2877536) (← links)
• Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects (Q5024914) (← links)
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190) (← links)
• Due-window assignment scheduling problems with position-dependent weights on a single machine (Q5059296) (← links)
• Research on common due window assignment flowshop scheduling with learning effect and resource allocation (Q5059340) (← links)
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine (Q6094568) (← links)