Pages that link to "Item:Q5131718"
From MaRDI portal
The following pages link to A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718):
Displaying 6 items.
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)
