An interactive procedure for bi-criteria production scheduling
From MaRDI portal
Publication:1332798
DOI10.1016/0305-0548(94)90082-5zbMath0810.90052OpenAlexW2032718267MaRDI QIDQ1332798
Publication date: 5 September 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90082-5
Related Items (3)
Due date and cost-based FMS loading, scheduling and tool management ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ Minimizing makespan subject to minimum total flow-time on identical parallel machines
Cites Work
- Solving a bicriterion scheduling problem
- Hybrid algorithm for sequencing with bicriteria
- A bicriterion approach to time/cost trade-offs in sequencing
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
This page was built for publication: An interactive procedure for bi-criteria production scheduling