On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
From MaRDI portal
Publication:3815121
DOI10.1057/jors.1988.193zbMath0663.90046MaRDI QIDQ3815121
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.193
65K05: Numerical mathematical programming methods
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
Related Items
Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, The distributed permutation flowshop scheduling problem, Job lateness in a two-machine flowshop with setup times separated, The job shop scheduling problem: Conventional and new solution techniques, A global MILP model for FMS scheduling, Mathematical models for preemptive shop scheduling problems, Two models for a family of flowshop sequencing problems, Flow-shop scheduling with flexible processors, Local search methods for the flowshop scheduling problem with flowtime minimization, A study of integer programming formulations for scheduling problems, Effective heuristics for the single machine sequencing problem with ready times
Uses Software
