Pages that link to "Item:Q1847225"
From MaRDI portal
The following pages link to Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225):
Displaying 27 items.
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
- Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
- Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← 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)
- Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan (Q1711478) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
- Bicriteria train scheduling for high-speed passenger railroad planning applications (Q2566708) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
- A high quality solution constructive heuristic for flow shop sequencing (Q4656763) (← links)
- A partial enumeration heuristic for multi-objective flowshop scheduling problems (Q4661250) (← links)
- Sequencing CONWIP flow-shops: Analysis and heuristics (Q4674420) (← links)
- (Q5154491) (← links)
- The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)
