Pages that link to "Item:Q5932026"

The following pages link to NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026):

Displayed 10 items.

• No-wait flexible flowshop scheduling with no-idle machines (Q813967) ‎ (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) ‎ (← links)
• Chromatic scheduling in a cyclic open shop (Q1767677) ‎ (← links)
• A note on minimizing maximum lateness in a two-machine no-wait flowshop (Q1879796) ‎ (← links)
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) ‎ (← links)
• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems (Q1887767) ‎ (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) ‎ (← links)
• Coupled task scheduling with exact delays: literature review and models (Q2282490) ‎ (← links)
• No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) ‎ (← links)
• On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) ‎ (← links)