Pages that link to "Item:Q922287"
From MaRDI portal
The following pages link to Reducibility among single machine weighted completion time scheduling problems (Q922287):
Displayed 3 items.
- Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)