Level scheduling under limited resequencing flexibility

DOI10.1007/s10696-010-9065-0zbMath1213.90116MaRDI QIDQ539476

Armin Scholl, Malte Fliedner, Nils Boysen

Publication date: 30 May 2011

Published in: Flexible Services and Manufacturing Journal (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00021006/2010-6.pdf

zbMATH Keywords

just-in-time; mixed-model assembly line; re-sequencing; level scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

Cites Work

• Unnamed Item
• Solving symmetric mixed-model multi-level just-in-time scheduling problems
• Sequencing mixed-model assembly lines: survey, classification and model critique
• The product rate variation problem and its relevance in real world mixed-model assembly lines
• Heuristics and exact algorithms for solving the Monden problem
• Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
• Cyclic just-in-time sequences are optimal
• The maximum deviation just-in-time scheduling problem.
• A simple sequencing algorithm for mixed-model assembly lines in just-in- time production systems
• Minimizing variation of production rates in just-in-time systems: A survey
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• A sequential ordering problem in automotive paint shops
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Searching optimal resequencing and feature assignment on an automated assembly line
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Least in-sequence probability heuristic for mixed-volume production lines
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs