Modelling and solving the production rate variation problem (PRVP)

DOI10.1007/BF02568551zbMath0892.90090MaRDI QIDQ1383316

Albert Corominas, Ramon Companys, Joaquín Bautista

Publication date: 13 April 1998

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

just-in-timeassignmentassembly lineproduction rate variation problem

Mathematics Subject Classification ID

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

Related Items (5)

Response time variability ⋮ A branch and bound algorithm for the response time variability problem ⋮ Solving the generalized apportionment problem through the optimization of discrepancy functions ⋮ Mathematical programming modeling of the response time variability problem ⋮ Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem

Cites Work

• A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
• Heuristics and exact algorithms for solving the Monden 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
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Developing production schedules which balance part usage and smooth production loads for just-in-time production systems
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Level Schedules for Mixed-Model, Just-in-Time Processes

This page was built for publication: Modelling and solving the production rate variation problem (PRVP)