New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
From MaRDI portal
Publication:1044141
DOI10.1016/j.ejor.2009.02.014zbMath1177.90154OpenAlexW2111751133MaRDI QIDQ1044141
Ayşegül Toptal, Manoj Kumar Tiwari, Fatih Safa Erenay, Ịhsan Sabuncuoğlu
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22429
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
Cites Work
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Multiple and bicriteria scheduling: A literature survey
- Complexity of single machine, multi-criteria scheduling problems
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- A bi-criterion single-machine scheduling problem with learning considerations
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Pareto optima for total weighted completion time and maximum lateness on a single machine
- Multicriteria scheduling
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- Genetic local search for multi-objective flowshop scheduling problems
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- Complexity of two dual criteria scheduling problems
- Scheduling with Multiple Performance Measures: The One-Machine Case
- A single-machine problem with multiple criteria
- One machine sequencing to minimize mean flow time with minimum number tardy
- A heuristic approach to bicriteria scheduling
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A note on the extension of a result on scheduling with secondary criteria
- Counting and enumeration complexity with application to multicriteria scheduling
This page was built for publication: New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
