Pages that link to "Item:Q655176"
From MaRDI portal
The following pages link to Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176):
Displaying 17 items.
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Discrete parallel machine makespan ScheLoc problem (Q1679512) (← links)
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors (Q3971845) (← links)
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions (Q3974115) (← links)
- On the Minimization of the Makespan Subject to Flowtime Optimality (Q4272903) (← links)
- Minimizing makespan in parallel flowshops (Q4356676) (← links)
- (Q4598212) (← links)
- Makespan minimization for \(m\) parallel identical processors (Q4865763) (← links)
