Pages that link to "Item:Q5953340"

The following pages link to Parallel machine scheduling with a common due window (Q5953340):

Displaying 14 items.

• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• Unbounded batch scheduling with a common due window on a single machine (Q611087) (← links)
• On scheduling around large restrictive common due windows (Q704121) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
• No-wait flexible flow shop scheduling with due windows (Q1665716) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times (Q2931172) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment (Q3430238) (← links)
• COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES (Q5411729) (← links)
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (Q6164365) (← links)