Pages that link to "Item:Q1853011"

The following pages link to Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. (Q1853011):

Displaying 10 items.

• The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324) (← links)
• Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
• Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time (Q933504) (← links)
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Scheduling multi-operation jobs on a single machine (Q1960312) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
• Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
• A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721) (← links)