The following pages link to Ali Allahverdi (Q296865):
Displaying 50 items.
- Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
- Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
- Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan (Q1010280) (← links)
- The two-stage assembly scheduling problem to minimize total completion time with setup times (Q1017445) (← links)
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
- (Q1341392) (redirect page) (← links)
- Two-machine ordered flowshop scheduling under random breakdowns (Q1341394) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Scheduling in stochastic flowshops with independent setup, processing and removal times (Q1366705) (← links)
- Total flowtime in no-wait flowshops with separated setup times. (Q1406685) (← links)
- No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
- New heuristics for no-wait flowshops to minimize makespan. (Q1413816) (← links)
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times (Q1415102) (← links)
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013) (← links)
- Stochastically minimizing total flowtime in flowshops with no waiting space (Q1806645) (← links)
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times (Q1968586) (← links)
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
- The significance of reducing setup times/setup costs (Q2467248) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
- The Tricriteria Two-Machine Flowshop Scheduling Problem (Q2767666) (← links)
- Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
- Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times (Q3011180) (← links)
- Permutation flow shops with exact time lags to minimise maximum lateness (Q3055251) (← links)
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
- Job lateness in flowshops with setup and removal times separated (Q3157767) (← links)
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
- Scheduling multi-stage parallel-processor services to minimize average response time (Q3369255) (← links)
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
