scispace - formally typeset
Search or ask a question
Topic

Goal programming

About: Goal programming is a research topic. Over the lifetime, 4330 publications have been published within this topic receiving 117758 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The chance-constrained approach with different dominance criteria is used to transform the stochastic fuzzy linear multiobjective programming problem to its equivalent deterministic-crisp linear programming problem.

28 citations

Journal ArticleDOI
TL;DR: An algorithm based on goal programming that effectively converges to the compromised Pareto optimal solution is proposed and achieves superior performance compared to the greedy and linear relaxation heuristics, and competitive performance relative to the optimal solution implemented in Linear Interactive and Discrete Optimizer for small-scale problems.
Abstract: We study the multi-objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consumption and response time (makespan) subject to the constraints of deadlines and architectural requirements We propose an algorithm based on goal programming that effectively converges to the compromised Pareto optimal solution Compared to other traditional multi-objective optimization techniques that require identification of the Pareto frontier, goal programming directly converges to the compromised solution Such a property makes goal programming a very efficient multi-objective optimization technique Moreover, simulation results show that the proposed technique achieves superior performance compared to the greedy and linear relaxation heuristics, and competitive performance relative to the optimal solution implemented in Linear Interactive and Discrete Optimizer (LINDO) for small-scale problems

28 citations

Journal ArticleDOI
TL;DR: A goal programming model for coordinating the production of an aggregate schedule which is to be fed into the detailed scheduling package currently employed is developed and discussed.
Abstract: The paper introduces mi overall scheduling problem. One crucial aspect is identified; this is the production of an aggregate schedule which is to be fed into the detailed scheduling package currently employed. The problem is seen to be that of achieving a balance between a smooth work-load on the factory floor and matching production with promised delivery dates. A goal programming model for this coordination is developed and discussed. Numerical examples illustrating the approach are presented, and computational experience is discussed.

28 citations

Journal ArticleDOI
TL;DR: A new multi-objective integer programming model for the daily scheduling of nurses in operating suites is provided, designed to assign nurses to different surgery cases based on their specialties and competency levels, subject to a series of hard and soft constraints related to nurse satisfaction, idle time, overtime, and job changes during a shift.
Abstract: This article provides a new multi-objective integer programming model for the daily scheduling of nurses in operating suites. The model is designed to assign nurses to different surgery cases based on their specialties and competency levels, subject to a series of hard and soft constraints related to nurse satisfaction, idle time, overtime, and job changes during a shift. To find solutions, two methodologies were developed. The first is based on the idea of a solution pool and the second is a variant of modified goal programming. The model and the solution procedures were validated using real data provided by the University of Texas MD Anderson Cancer Center in Houston, Texas. The results show that the two methodologies can produce schedules that satisfy all demand with 50% less overtime and 50% less idle time when benchmarked against current practice.

27 citations

01 Jan 2010
TL;DR: This paper will be presented the interval linear programming problems, where the coefficients and variables are in the form of intervals, and the problems will be solved by modification simplex method.
Abstract: The conventional linear programming model requires the parameters to be known as constants. In the real world, however, the parameters are seldom known exactly and have to be estimated. Interval programming is one of the tools to tackle uncertainty in mathematical programming models. In this paper, it will be presented the interval linear programming problems, where the coefficients and variables are in the form of intervals. The problems will be solved by modification simplex method.

27 citations


Network Information
Related Topics (5)
Supply chain
84.1K papers, 1.7M citations
84% related
Supply chain management
39K papers, 1M citations
82% related
Fuzzy set
44.4K papers, 1.1M citations
80% related
Scheduling (computing)
78.6K papers, 1.3M citations
80% related
Fuzzy logic
151.2K papers, 2.3M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202335
202271
2021151
2020138
2019160
2018145