Bicriteria scheduling problem for unrelated parallel machines
References (31)
Single machine scheduling to minimize weighted sum of completion time with secondary criteria—a branch and bound approach
Europ. J. Ops Res.
(1980)- et al.
Bicriteria static scheduling research for a single machine
OMEGA
(1988) - et al.
Computational feasibility for multicriteria models of production, planning and scheduling
Computers Ind. Engng
(1988) - et al.
A framework for single machine multiple objective sequencing research
OMEGA
(1989) - et al.
New approaches for heuristic search: a linkage with AI
Europ. J. Ops. Res.
(1989) A multiple decision theoretic approach to one machine scheduling problem
Computers Ops. Res.
(1980)- et al.
Multicriteria job shop scheduling
Computers Ind. Engng
(1989) - et al.
Minimizing maximum tardiness for unrelated parallel machines
Int. J. Prod. Econ.
(1994) - et al.
Solving a bicriteria scheduling problem
Eur. J. Ops. Res.
(1980) - et al.
A new heuristic method for the flow shop sequencing problem
Eur. J. Ops. Res.
(1989)
Sensitivity analysis of multiattribute value models
Ops. Res.
Scheduling to minimize the weighted sum of completion time with secondary criteria
NRLQ
Multiple Objective Programming and Planning
A note on a scheduling problem with dual criteria
NRLQ
Sequencing and Scheduling: Introduction to the Mathematics of the Job Shop
Cited by (45)
Single machine scheduling with two-agent for total weighted completion time objectives
2018, Applied Soft Computing JournalCitation Excerpt :In the present paper, the objectives of two-agents are in conflict, because the completion time of jobs for the two agents are mutually independent. To address the conflicting nature of objective functions, Suresh and Chaudhuri [14] suggested to two approaches: (1) assign weight to the objective of each agent and minimize the weighted objective function; (2) minimize the objective function of one agent while keeping the objective function of the other agent within a pre-specified level. T. E. Cheng et al. [15] named these two types of single machine with multi-agent scheduling problem as a “minimality model” and a “feasibility model,” respectively.
A NSGA-II based memetic algorithm for multiobjective parallel flowshop scheduling problem
2017, Computers and Industrial EngineeringCitation Excerpt :Similarly, multiobjective PMS problems had been also widely studied in the literature and the most works focus on the technique of ‘posteriori’. Suresh and Chaudhuri (1996) proposed a TS based algorithm for a PMS problem with two objective functions of minimizing the makespan and the maximum tardiness. Cochran, Horng, and Fowler (2003) presented a two-stage multi-population GA for a PMS problem to minimize three different criteria that are the makespan, the total weighted tardiness and the total weighted completion time respectively.
Bicriteria scheduling problem for unrelated parallel machines with release dates
2015, Computers and Operations ResearchCitation Excerpt :There is some research that uses genetic algorithm (GA)-based approaches to solve parallel machines with bicriteria objective scheduling problems [6,12,25,43], and some research that uses simulated annealing to solve parallel machines with bicriteria objective scheduling problems [17,37]. Additionally, there is some research that uses tabu searches to solve parallel machines with bicriteria objective scheduling problems [4,42]. In this research, we propose a bicriteria heuristic based on NEH [31] and apparent tardiness cost with release date (ATCR)[26] for the studied problem.
Multiple-objective heuristics for scheduling unrelated parallel machines
2013, European Journal of Operational ResearchNon-permutation flowshop scheduling with dual resources Yasaman Mehravaran1
2013, Expert Systems with ApplicationsCitation Excerpt :There is a weight assigned to each job which shows the importance of those jobs in terms of WIP cost and service level. Most of the previous studies on scheduling problems with bicriteria goal (Chauhan, Gordon, & Proth, 2007; Chen & Vairaktarakis, 2005; Choua & Lee, 1999; Eren & Güner, 2006; Koksalan & Burak Keha, 2003; Mansouri, Hendizadeh, & Salmasi, 2009; Mehravaran & Logendran, 2011; Suresh & Chaudhuri, 1996) also attempt to consider the coordination of the producer and customers. In this research we tackled both objectives at the same time by using the traditional and the most common method of weighted aggregating function rather than the Pareto optimization.
Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey
2023, Artificial Intelligence Review
- ∗
Presently with Techno Economics Division, Kuwait Institute for Scientific Research, P.O. Box 24885, Safat 13109, Kuwait.