Pages that link to "Item:Q1869720"
From MaRDI portal
The following pages link to The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720):
Displaying 19 items.
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times (Q967801) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
- Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- The tricriteria two-machine flowshop scheduling problem (Q2767666) (← links)
- Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines (Q3156679) (← links)
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872) (← links)
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
- TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES (Q3703568) (← links)
- A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q5431617) (← links)
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
