Mathematical model for cyclic scheduling with work-in-process minimization
From MaRDI portal
(Redirected from Publication:656064)
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3231743 (Why is no real title available?)
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- An Automatic Method of Solving Discrete Programming Problems
- An improved shifting bottleneck procedure for the job shop scheduling problem
- Branch-and-price: Column generation for solving huge integer programs
- Cyclic Schedules for Job Shops with Identical Jobs
- Performance evaluation of job-shop systems using timed event-graphs
- Solving transient scheduling problems with constraint programming
- The Cutting-Plane Method for Solving Convex Programs
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Two FMS scheduling methods based on Petri nets: A global and a local approach
This page was built for publication: Mathematical model for cyclic scheduling with work-in-process minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656064)