Mathematical model for cyclic scheduling with work-in-process minimization
From MaRDI portal
Publication:656064
DOI10.1007/s10696-011-9093-4zbMath1230.90086OpenAlexW2066004965MaRDI QIDQ656064
Hervé Camus, Mohamed Amin Ben Amar, Ouajdi Korbaa, Thomas Bourdeaud'huy
Publication date: 26 January 2012
Published in: Flexible Services and Manufacturing Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10696-011-9093-4
mathematical modelinginteger linear programmingbenchmarkscyclic schedulingminimal cycle timework in process
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
- Solving transient scheduling problems with constraint programming
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Cutting-Plane Method for Solving Convex Programs
- An Automatic Method of Solving Discrete Programming Problems
- Performance evaluation of job-shop systems using timed event-graphs
- Cyclic Schedules for Job Shops with Identical Jobs
- Two FMS scheduling methods based on Petri nets: A global and a local approach
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
This page was built for publication: Mathematical model for cyclic scheduling with work-in-process minimization