Pages that link to "Item:Q5315931"
From MaRDI portal
The following pages link to APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931):
Displaying 13 items.
- Preemptive scheduling in the presence of transportation times (Q1010294) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
- Flexible job shop scheduling with blockages (Q2454071) (← links)
- A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
- Approximation Algorithms for Fixed Job Schedule Problems (Q3990569) (← links)
- (Q4508364) (← links)
- A fine-grained parallel algorithm for the cyclic flexible job shop problem (Q4971705) (← links)
- A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints (Q6092532) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)