Pages that link to "Item:Q1404274"

The following pages link to Concurrent open shop scheduling to minimize the weighted number of tardy jobs (Q1404274):

Displaying 18 items.

• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
• Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
• A note on the complexity of the concurrent open shop problem (Q880556) (← links)
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
• On complexity of minimizing weighted number of late jobs in unit time open shops (Q1356519) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
• Two-machine flowshop scheduling in a physical examination center (Q1740429) (← links)
• A note on the complexity of two supply chain scheduling problems (Q2059093) (← links)
• On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• The representation of partially-concurrent open shop problems (Q2398435) (← links)
• Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
• Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)