Pages that link to "Item:Q1919786"

The following pages link to Single machine scheduling to minimize the number of early and tardy jobs (Q1919786):

Displaying 33 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
• A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← links)
• A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
• Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Single-machine scheduling with a common due window (Q5926034) (← links)
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs (Q5959375) (← links)
• Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)