A scheduling problem in the baking industry
From MaRDI portal
Publication:2336885
DOI10.1155/2014/964120zbMath1442.90070OpenAlexW2037676073WikidataQ59054513 ScholiaQ59054513MaRDI QIDQ2336885
Anibal Tavares de Azevedo, Felipe Augusto Moreira da Silva, Antonio Carlos Moretti
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/964120
Uses Software
Cites Work
- Branch and bound algorithm for the flow shop with multiple processors
- Greedy-type resistance of combinatorial problems
- A genetic algorithm for the job shop problem
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- The flow shop with parallel machines: A tabu search approach
- A survey of scheduling problems with setup times or costs
- Optimal two- and three-stage production schedules with setup times included
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- A computational study of heuristics for two-stage flexible flowshops
- An Algorithm for the Traveling Salesman Problem
- The theory of dynamic programming
- Unnamed Item
- Unnamed Item
