Pages that link to "Item:Q1765532"
From MaRDI portal
The following pages link to A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532):
Displaying 12 items.
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Scheduling at coal handling facilities using simulated annealing (Q953296) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← 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)
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop (Q6047924) (← links)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
