Job-shop production scheduling with reverse flows
From MaRDI portal
Publication:319298
DOI10.1016/j.ejor.2015.01.013zbMath1346.90320OpenAlexW1984515446MaRDI QIDQ319298
Zied Bahroun, Julien Fondrevelle, Mohamed Amine Abdeljaouad, Anissa Omrane
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.013
Related Items
Cites Work
- Mathematical programming formulations for machine scheduling: A survey
- A balancing method and genetic algorithm for disassembly line balancing
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
- Some efficient heuristic methods for the flow shop sequencing problem
- A path-relinking approach for a bi-criteria disassembly sequencing problem
- A strategic and tactical model for closed-loop supply chains
- Simultaneous design and planning of supply chains with reverse flows: a generic modelling framework
- Surrogate duality relaxation for job shop scheduling
- The complexity of shop-scheduling problems with two or three jobs
- The job shop scheduling problem: Conventional and new solution techniques
- Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- A survey and evaluation of static flowshop scheduling heuristics
- Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
- A branch and bound algorithm for disassembly scheduling with assembly product structure
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Concurrent product and closed-loop supply chain design with an application to refrigerators
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Disassembly scheduling: literature review and future research directions
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
