Pages that link to "Item:Q5466734"
From MaRDI portal
The following pages link to Flowshop-scheduling problems with makespan criterion: a review (Q5466734):
Displaying 50 items.
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
- A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty (Q534809) (← links)
- Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation (Q555434) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints (Q1721157) (← links)
- A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing (Q1730499) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Classifying and modeling setups and cleanings in lot sizing and scheduling (Q1753633) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty (Q2294752) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems (Q2967585) (← links)
- A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly (Q2997879) (← links)
- A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling (Q3163237) (← links)
