Online citations, reference lists, and bibliographies.
← Back to Search

Multiple And Bicriteria Scheduling : A Literature Survey

A. Nagar, J. Haddock, S. Heragu
Published 1995 · Mathematics

Save to my Library
Download PDF
Analyze on Scholarcy Visualize in Litmaps
Share
Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager
Time to take this seriously.
Get Citationsy
Abstract Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. A solution which is optimal with respect to a given criterion might be a poor candidate for some other. The trade-offs involved in considering several different criteria provide useful insights to the decision maker. Thus considering problems with more than one criterion is more releBANt in the context of real life scheduling problems. Surprisingly, research in this important field has been scarce when compared to research in single criterion scheduling. In this paper, we provide a detailed literature survey of multiple and bicriteria problems in scheduling. We also provide a broad classification scheme for scheduling problems.
This paper references
10.1002/NAV.3800030106
Various optimizers for single‐stage production
W. Smith (1956)
10.1002/NAV.3800060205
An integer linear‐programming model for machine scheduling
H. Wagner (1959)
10.1287/OPRE.7.5.621
THE SCHEDULE-SEQUENCING PROBLEM*
E. H. Bowman (1959)
10.1287/OPRE.8.2.219
On the Job-Shop Scheduling Problem
A. S. Manne (1960)
10.1287/MNSC.6.2.191
A Machine-Job Scheduling Model
G. Dantzig (1960)
10.1287/OPRE.13.3.400
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
E. Ignall (1965)
10.1057/JORS.1966.25
Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem
A. Brown (1966)
10.1287/MNSC.15.1.102
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
J. M. Moore (1968)
10.1287/opre.16.2.353
A Branch-Bound Solution to the General Scheduling Problem
H. H. Greenberg (1968)
10.1287/MNSC.16.1.93
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
A. A. Pritsker (1969)
10.1002/NAV.3800190215
A note on the extension of a result on scheduling with secondary criteria
Horace W. Heck (1972)
10.1287/MNSC.19.5.544
Optimal Sequencing of a Single Machine Subject to Precedence Constraints
E. Lawler (1973)
10.1057/jors.1977.60
Introduction to sequencing and scheduling
A. J. Clewett (1974)
10.1016/S0167-5060(08)70743-X
Complexity of machine scheduling problems
P. Brucker (1975)
10.1002/NAV.3800220317
A note on a scheduling problem with dual criteria
H. Emmons (1975)
10.1002/NAV.3800220314
One machine sequencing to minimize mean flow time with minimum number tardy
H. Emmons (1975)
Computer and job-shop scheduling theory
E. Coffman (1976)
10.1002/NAV.3800230111
Scheduling to minimize the weighted sum of completion times with secondary criteria
R. N. Burns (1976)
10.1287/opre.24.4.611
Branch-and-Bound Strategies for Dynamic Programming
Thomas L. Morin (1976)
10.1016/0377-2217(78)90043-7
Four solution techniques for a general one machine scheduling problem: A comparative study
L. V. Wassenhove (1978)
10.1016/0377-2217(80)90087-9
Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach
S. P. Bansal (1980)
10.1007/BF01920271
On the interactive solution to a multicriteria scheduling problem
K. Huckert (1980)
10.1016/0305-0548(80)90023-4
A multiple objective decision theoretic approach to one-machine scheduling problems
E. Kao (1980)
10.1287/opre.28.5.1155
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
R. Vickson (1980)
10.1016/0377-2217(80)90038-7
Solving a bicriterion scheduling problem
L. V. Wassenhove (1980)
10.15807/JORSJ.24.37
ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
S. Miyazaki (1981)
10.1016/0377-2217(81)90348-9
Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
R. Slowinski (1981)
10.1287/opre.29.1.146
Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
J. Barnes (1981)
10.1002/NAV.3800290114
Scheduling of a single machine to minimize total weighted completion time subject to release dates
L. Bianco (1982)
10.1016/0305-0548(82)90025-9
Multiple criteria job-shop scheduling
R. Deckro (1982)
10.1016/S0377-2217(82)80008-8
A bicriterion approach to time/cost trade-offs in sequencing
L. V. Wassenhove (1982)
10.1080/05695558308974617
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem
Sen Tapan (1983)
10.1007/BF00934608
Hybrid algorithm for sequencing with bicriteria
K. Lin (1983)
10.1080/00207548308942390
Master production scheduling: a multiple-objective linear programming approach
Juan J. Gonzalez (1983)
10.1016/0305-0548(83)90018-7
Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number
J. Shanthikumar (1983)
10.1080/07408178408975250
A Generalized Goal Programming Approach to the Minimal Interference, Multicriteria N × 1 Scheduling Problem
J. Ignizio (1984)
Sequencing and scheduling
J. K. Lenstra (1985)
10.1287/MNSC.32.4.464
Scheduling with multiple performance measures: the one-machine case
R. Nelson (1986)
10.1002/NAV.3800330319
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
S. Chand (1986)
10.1057/JORS.1986.197
A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
W. Selen (1986)
10.1016/0305-0483(88)90008-4
Bicriterion static scheduling research for a single machine
P. Dileepan (1988)
10.1287/MNSC.34.2.254
A branch-and-bound approach to the bicriterion scheduling problem invloving total flowtime and range of lateness
Tapan Sen (1988)
10.1016/0377-2217(88)90251-2
A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
Mario I. Norbis (1988)
10.1016/0377-2217(89)90276-2
A new integer programming formulation for the permutation flowshop problem
A. Frieze (1989)
10.1057/JORS.1989.58
Alternative Formulations of a Flow-shop Scheduling Problem
J. M. Wilson (1989)
10.1016/0305-0483(89)90063-7
A framework for single machine multiple objective sequencing research
T. Fry (1989)
10.1016/0305-0548(89)90034-8
Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
T. C. John (1989)
10.1109/CAIA.1990.89177
Satisfying conflicting objectives in factory scheduling
P. Berry (1990)
10.1016/0377-2217(90)90376-M
A multi-objective approach to resource allocation in single machine scheduling
R. Daniels (1990)
10.1016/0305-0548(90)90022-Y
Scheduling unit processing time jobs on a single machine with multiple criteria
Chuen-Lung Chen (1990)
10.1016/0167-188X(90)90095-Y
Multi-objective, multi-period planning for a manufacturing plant
T. Trzaskalik (1990)
10.1287/opre.38.1.22
Sequencing with Earliness and Tardiness Penalties: A Review
K. Baker (1990)
Resolving conflicting objectives in factory scheduling
F. Berry (1990)
10.1016/0167-188X(91)90008-P
Bicriterion jobshop scheduling with total flowtime and sum of squared lateness
P. Dileepan (1991)
10.1057/JORS.1991.83
An Improved Solution Procedure for the Scheduling Problem
T. Cheng (1991)
10.1016/0305-0548(91)90009-G
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
P. De (1991)
10.1287/opre.40.1.7
The Lessons of Flowshop Scheduling Research
R. Dudek (1992)
10.1287/MNSC.38.7.1018
A broader view of the job-shop scheduling problem
L. Wein (1992)



This paper is referenced by
10.1016/j.dam.2020.10.001
On Lagrangian relaxation for constrained maximization and reoptimization problems
A. Kulik (2021)
10.1016/j.swevo.2020.100805
Two-objective robust job-shop scheduling with two problem-specific neighborhood structures
Xiaozhi Wang (2021)
10.1080/00207543.2020.1845914
On the trade-offs between scheduling objectives for unpaced mixed-model assembly lines
Frederik Ferid Ostermeier (2020)
10.1007/s10878-020-00591-3
Multiprocessor open shop problem: literature review and future directions
Zeynep Adak (2020)
10.5772/INTECHOPEN.91169
A Brief Look at Multi-Criteria Problems: Multi-Threshold Optimization versus Pareto-Optimization
N. Vakhania (2020)
BI-CRITERIA SCHEDULING
Xiaojuan Jiang (2019)
10.1109/ACCESS.2019.2929582
Scheduling Jobs of Two Competing Agents on a Single Machine
Chen-Yang Cheng (2019)
10.1080/00207543.2018.1471240
A Hybrid Discrete Bat Algorithm with Krill Herd-based advanced planning and scheduling tool for the capital goods industry
Sirikarn Chansombat (2019)
10.1109/TFUZZ.2018.2879789
A NSGA-II Algorithm Hybridizing Local Simulated-Annealing Operators for a Bi-Criteria Robust Job-Shop Scheduling Problem Under Scenarios
Bing Wang (2019)
10.1016/j.cor.2018.09.005
On the flexibility of a decision theory-based heuristic for single machine scheduling
Christian Gahm (2019)
10.1007/S10845-016-1291-1
Application of an evolutionary algorithm-based ensemble model to job-shop scheduling
C. J. Tan (2019)
10.1111/itor.12360
Multiobjective bed management considering emergency and elective patient flows
P. Landa (2018)
10.1007/s10462-018-9667-6
A state of the art review of intelligent scheduling
M. Zarandi (2018)
10.1016/j.cie.2018.05.021
A minimax linear programming model for dispatching rule selection
G. R. Amin (2018)
10.1007/s10479-018-2775-5
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Emna Dhouib (2018)
10.5391/IJFIS.2017.17.3.221
A Robust Solution to Resource-Constraint Project Scheduling Problem
Milad Keshavarz Kord Mahalleh (2017)
10.1016/j.cie.2017.06.026
Machine scheduling problems in production: A tertiary study
Hamid Abedinnia (2017)
10.1016/J.IJPE.2016.03.019
A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm
Srisatja Vitayasak (2017)
10.1007/978-3-319-54157-0_26
Towards Standardized and Seamless Integration of Expert Knowledge into Multi-objective Evolutionary Optimization Algorithms
Magdalena A. K. Lang (2017)
Algorithms for Multicriteria Scheduling Problems
Tariq S. Abdul-Razaq and Karar F. Abdul-Razaq (2016)
Exact and Approximation Approaches for Solving Multiple Objective Function
T. S. Abdul-Razaq (2016)
10.1007/978-3-319-23350-5_13
Meta-heuristics Approaches for the Flexible Job Shop Scheduling Problem
M. Gaham (2016)
10.1088/1757-899X/145/2/022019
Multi-criteria evaluation methods in the production scheduling
K. Kalinowski (2016)
Vitayasak S, Pongcharoen P, Hicks C. A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search
Srisatja Vitayasak (2016)
10.1057/jors.2015.75
A bi-criteria hybrid metaheuristic for analysing an integrated automotive supply chain
Sherif A. Masoud (2016)
Modeling the Problem of Multi-Objective Job Shop Scheduling Based on Security and its Solution
Qing-dao-er-ji Ren (2016)
Algorithms for Scheduling a Single Machine to Minimize Total Completion Time and Total Tardiness
T. Ali (2016)
10.1016/j.jcta.2015.11.001
Scheduling problems
Felix Breuer (2016)
10.1109/INDUSENG.2016.7519349
Resource Constraint Project Scheduling to meet Net Present Value and quality objectives of the program
M. S. Rad (2016)
10.3934/JIMO.2016.12.1465
Minimizing the weighted number of tardy jobs on multiple machines: A review
M. O. Adamu (2016)
10.1109/SYSCON.2015.7116747
A multi-objective evolutionary algorithm-based decision support system: A case study on job-shop scheduling in manufacturing
C. J. Tan (2015)
Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
Tariq S. Abdul-Razaq طارق صالح عبد الرزاق (2015)
See more
Semantic Scholar Logo Some data provided by SemanticScholar