Incorporating preference information into multi-objective scheduling
From MaRDI portal
Publication:1333459
DOI10.1016/0377-2217(94)90372-7zbMath0809.90077OpenAlexW1968432056MaRDI QIDQ1333459
Publication date: 28 March 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90372-7
Related Items (4)
Multicriteria scheduling using fuzzy theory and tabu search ⋮ Cultural-based genetic tabu algorithm for multiobjective job shop scheduling ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ Modelling and heuristics of FMS scheduling with multiple objectives
Cites Work
- Solving a bicriterion scheduling problem
- Hybrid algorithm for sequencing with bicriteria
- A bicriterion approach to time/cost trade-offs in sequencing
- A multi-objective approach to resource allocation in single machine scheduling
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Incorporating preference information into multi-objective scheduling
