An Improved Formulation for the Job-Shop Scheduling Problem
From MaRDI portal
Publication:4016258
Cited in
(15)- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- Mathematical models for preemptive shop scheduling problems
- Flow-shop scheduling with flexible processors
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- A study of integer programming formulations for scheduling problems
- Mixed integer programming models for job shop scheduling: A computational analysis
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- A proposal of web application for the study and resolution of the job shop problem with makespan minimization via mixed integer linear programming
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
This page was built for publication: An Improved Formulation for the Job-Shop Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016258)
