Pages that link to "Item:Q1890952"

The following pages link to Scheduling shops to minimize the weighted number of late jobs (Q1890952):

Displaying 25 items.

• A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
• A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
• A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine (Q1037662) (← links)
• On complexity of minimizing weighted number of late jobs in unit time open shops (Q1356519) (← links)
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs (Q1404274) (← links)
• Open shop scheduling problems with late work criteria. (Q1421458) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
• The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
• Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
• Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
• (Q2712360) (← links)
• Scheduling job shops with delays (Q3351125) (← links)
• Open shop scheduling to minimize the number of late jobs (Q4248926) (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)