Pages that link to "Item:Q880556"

The following pages link to A note on the complexity of the concurrent open shop problem (Q880556):

Displaying 15 items.

• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• Scheduling fully parallel jobs (Q2317138) (← 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)
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
• A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← 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 Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)