| Publication | Date of Publication | Type |
|---|
Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
Engineering Optimization | 2023-10-10 | Paper |
Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
RAIRO - Operations Research | 2023-09-19 | Paper |
Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
Journal of Industrial and Management Optimization | 2021-11-12 | Paper |
A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
Journal of Industrial and Management Optimization | 2021-09-10 | Paper |
Minimizing total completion time for flowshop scheduling problem with uncertain processing times
RAIRO - Operations Research | 2021-07-27 | Paper |
Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan
RAIRO - Operations Research | 2020-05-13 | Paper |
Two-stage assembly scheduling problem for minimizing total tardiness with setup times
Applied Mathematical Modelling | 2020-02-05 | Paper |
Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Applied Mathematical Modelling | 2020-01-27 | Paper |
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
Applied Mathematics and Computation | 2020-01-14 | Paper |
Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
Computational and Applied Mathematics | 2019-01-29 | Paper |
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
Applied Mathematical Modelling | 2018-10-09 | Paper |
A survey of scheduling problems with no-wait in process
European Journal of Operational Research | 2018-05-24 | Paper |
No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
European Journal of Operational Research | 2018-05-22 | Paper |
Minimizing total tardiness in no-wait flowshops
Foundations of Computing and Decision Sciences | 2017-04-25 | Paper |
Single machine scheduling problem with interval processing times to minimize mean weighted completion time
Computers & Operations Research | 2016-11-10 | Paper |
The third comprehensive survey on scheduling problems with setup times/costs
European Journal of Operational Research | 2016-10-06 | Paper |
Total completion time with makespan constraint in no-wait flowshops with setup times
European Journal of Operational Research | 2016-06-23 | Paper |
Heuristics for no-wait flowshops with makespan subject to mean completion time
Applied Mathematics and Computation | 2014-06-27 | Paper |
Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
Decision Making in Manufacturing and Services | 2011-06-28 | Paper |
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
Computers & Mathematics with Applications | 2010-12-14 | Paper |
Permutation flow shops with exact time lags to minimise maximum lateness
International Journal of Production Research | 2010-11-07 | Paper |
New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
International Journal of Production Research | 2010-11-07 | Paper |
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
International Journal of Production Research | 2010-10-25 | Paper |
Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
Computers & Mathematics with Applications | 2010-06-28 | Paper |
The two-stage assembly scheduling problem to minimize total completion time with setup times
Computers & Operations Research | 2009-05-19 | Paper |
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Computers & Operations Research | 2009-04-03 | Paper |
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
Computers & Operations Research | 2008-12-04 | Paper |
scientific article; zbMATH DE number 5375343 (Why is no real title available?)
| 2008-12-01 | Paper |
A hybrid tabu search heuristic for the two-stage assembly scheduling problem
| 2008-01-28 | Paper |
scientific article; zbMATH DE number 5230329 (Why is no real title available?)
| 2008-01-28 | Paper |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
Annals of Operations Research | 2008-01-25 | Paper |
The significance of reducing setup times/setup costs
European Journal of Operational Research | 2008-01-21 | Paper |
Batching deteriorating items with applications in computer communication and reverse logistics
European Journal of Operational Research | 2007-06-13 | Paper |
A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
European Journal of Operational Research | 2007-05-11 | Paper |
scientific article; zbMATH DE number 5151911 (Why is no real title available?)
| 2007-05-11 | Paper |
Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
International Journal of Production Research | 2007-03-21 | Paper |
Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
International Journal of Production Research | 2007-03-21 | Paper |
Using mixed graph coloring to minimize total completion time in job shop scheduling
Applied Mathematics and Computation | 2007-01-11 | Paper |
Scheduling multi-stage parallel-processor services to minimize average response time
The Journal of the Operational Research Society | 2006-02-13 | Paper |
Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-01-17 | Paper |
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
European Journal of Operational Research | 2005-11-04 | Paper |
A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
Computers & Operations Research | 2005-11-01 | Paper |
Flowshop scheduling problem to minimize total completion time with random and bounded processing times
The Journal of the Operational Research Society | 2005-04-04 | Paper |
Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
The Journal of the Operational Research Society | 2005-03-16 | Paper |
No-wait flowshops with bicriteria of makespan and total completion time
The Journal of the Operational Research Society | 2005-03-14 | Paper |
A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Computers & Operations Research | 2005-02-23 | Paper |
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
International Transactions in Operational Research | 2005-01-31 | Paper |
Job lateness in flowshops with setup and removal times separated
The Journal of the Operational Research Society | 2005-01-19 | Paper |
Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
International Journal of Mathematics and Mathematical Sciences | 2003-12-03 | Paper |
New heuristics for no-wait flowshops to minimize makespan.
Computers & Operations Research | 2003-11-17 | Paper |
No-wait flowshops with bicriteria of makespan and maximum lateness.
European Journal of Operational Research | 2003-10-14 | Paper |
Total flowtime in no-wait flowshops with separated setup times.
Computers & Operations Research | 2003-09-07 | Paper |
Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
International Transactions in Operational Research | 2003-06-23 | Paper |
The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
European Journal of Operational Research | 2003-04-28 | Paper |
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
Computers & Operations Research | 2002-05-14 | Paper |
The tricriteria two-machine flowshop scheduling problem
International Transactions in Operational Research | 2002-01-30 | Paper |
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
Computers & Operations Research | 2000-09-26 | Paper |
Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
European Journal of Operational Research | 1999-12-20 | Paper |
Stochastically minimizing total flowtime in flowshops with no waiting space
European Journal of Operational Research | 1999-11-08 | Paper |
Scheduling in stochastic flowshops with independent setup, processing and removal times
Computers & Operations Research | 1997-09-17 | Paper |
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Computers & Operations Research | 1997-01-06 | Paper |
Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
The Journal of the Operational Research Society | 1995-11-09 | Paper |
Two-machine ordered flowshop scheduling under random breakdowns
Mathematical and Computer Modelling | 1995-01-11 | Paper |
scientific article; zbMATH DE number 640393 (Why is no real title available?)
| 1994-09-19 | Paper |
