A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem

DOI10.2307/2582302MaRDI QIDQ3790927zbMATH OpenOpenAlexFDO

Authors D. D. Hott, Willem J. Selen

Publication date 1986

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

Full work available at URL https://doi.org/10.2307/2582302

zbMATH Keywords

flow-shop schedulinggoal programmingmakespanmean flow-timemixed- integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• A new formulation and solution of the flowshop scheduling problem with no in-process waiting
• scientific article; zbMATH DE number 4093162
• A nonlinear mixed integer goal programming model for the two-machine closed flow shop
• scientific article; zbMATH DE number 3854789
• Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling

Cited in

(22)

• A new formulation and solution of the flowshop scheduling problem with no in-process waiting
• A new integer programming formulation for the permutation flowshop problem
• Multiple and bicriteria scheduling: A literature survey
• A nonlinear mixed integer goal programming model for the two-machine closed flow shop
• A multicriteria decision-making approach to university resource allocations and information infrastructure planning
• On the exact solution of the no-wait flow shop problem with due date constraints
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Solving multi-objective production scheduling problems using metaheuristics
• Bilevel programming applied to the flow shop scheduling problem
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• A two-step approach to incorporate cut-off grade and stockpiling in oil sands mine planning optimization framework
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Multicriteria scheduling problems: a survey
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• A study of integer programming formulations for scheduling problems
• A real-time order acceptance and scheduling approach for permutation flow shop problems
• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
• A mixed integer linear programming model for simultaneous design and scheduling of flowshop plants
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• KBSS: A knowledge-based system for scheduling in automated manufacturing
• Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
• A bicriteria flowshop scheduling with a learning effect

This page was built for publication: A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790927)