Pages that link to "Item:Q5946718"
From MaRDI portal
The following pages link to Scheduling jobshops with some identical or similar jobs (Q5946718):
Displaying 13 items.
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan (Q724743) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- Approximate solution of a dynamic job shop model with several job classes (Q1310003) (← links)
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective (Q1600095) (← links)
- A push-pull queueing system (Q1870012) (← links)
- Construction of cyclic schedules in presence of parallel machines (Q2984968) (← links)
- A Fluid Heuristic for Minimizing Makespan in Job Shops (Q3635130) (← links)
- Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138) (← links)
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time (Q6495522) (← links)
- Makespan minimization in reentrant flow shop problem with identical jobs (Q6573405) (← links)