Pages that link to "Item:Q1960312"
From MaRDI portal
The following pages link to Scheduling multi-operation jobs on a single machine (Q1960312):
Displaying 14 items.
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- 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)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. (Q1853011) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective (Q3156721) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
