An Improved Formulation for the Job-Shop Scheduling Problem

DOI10.1057/jors.1992.162zbMath0775.90236OpenAlexW2169224602MaRDI QIDQ4016258

Chii-Tsuen You, Ching-Jong Liao

Publication date: 16 December 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1992.162

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Flow-shop scheduling with flexible processors ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ 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 ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports ⋮ Mathematical models for preemptive shop scheduling problems ⋮ Mixed binary integer programming formulations for the reentrant job shop scheduling problem ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ A study of integer programming formulations for scheduling problems

Uses Software

• LINDO

This page was built for publication: An Improved Formulation for the Job-Shop Scheduling Problem