Level schedules for mixed-model JIT production lines: characteristics of the largest instances that can be solved optimally

DOI10.1080/00207540701223394zbMath1160.90427OpenAlexW2081660128MaRDI QIDQ5385396

John Miltenburg

Publication date: 6 May 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701223394

zbMATH Keywords

dynamic programminglevel schedules in just-in-time productionsequencing mixed-model production

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)

Related Items

Optimal production sequencing problem to minimise line stoppage time in a mixed-model assembly line ⋮ On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems ⋮ Solving symmetric mixed-model multi-level just-in-time scheduling problems ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem

Cites Work

• Unnamed Item
• Algorithms for the car sequencing and the level scheduling problem
• Heuristics and exact algorithms for solving the Monden problem
• Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
• A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines
• Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Sequencing problem for a mixed-model assembly line in the Toyota production system

This page was built for publication: Level schedules for mixed-model JIT production lines: characteristics of the largest instances that can be solved optimally