Pages that link to "Item:Q2668761"
From MaRDI portal
The following pages link to A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761):
Displaying 4 items.
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- Mixed graph coloring for unit-time job-shop scheduling (Q2784175) (← links)
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
- Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm (Q6551055) (← links)