scientific article; zbMATH DE number 5052107
From MaRDI portal
Publication:5486497
Recommendations
- Minimizing makespan in a three-stage flexible flowshop with identical machines and two batch processors
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
- A new three-machine shop scheduling: complexity and approximation algorithm
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- scientific article; zbMATH DE number 522730
- Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
- Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486497)
