Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
From MaRDI portal
Publication:4807200
DOI10.1080/00207540210136522zbMath1064.90526OpenAlexW2072355004MaRDI QIDQ4807200
Publication date: 2002
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210136522
Related Items
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ An ant colony optimisation algorithm for scheduling in agile manufacturing ⋮ Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms ⋮ RFID-enhanced multi-agent based control for a machining system ⋮ The hybrid flow shop scheduling problem ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing
Cites Work
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Branch and bound algorithm for the flow shop with multiple processors
- Mathematical programming formulations for machine scheduling: A survey
- A state-of-the-art review of parallel-machine scheduling research
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- Optimal two- and three-stage production schedules with setup times included
- Mathematical Modeling of Scheduling Problems
- Evaluation of a MULTIFIT-based scheduling algorithm
- Two-Stage, Hybrid Flowshop Scheduling Problem
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Application of Bin-Packing to Multiprocessor Scheduling
- `` Strong NP-Completeness Results
- Performance analysis of modular products
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Bounds on Multiprocessing Timing Anomalies