New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

DOI10.1016/J.EJOR.2009.02.014MaRDI QIDQ1044141zbMATH OpenOpenAlexFDO

Authors Fatih Safa Erenay, Ayşegül Toptal, M. K. Tiwari, Ihsan Sabuncuoglu

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

zbMATH Keywords

average flowtimebeam searchbicriteria schedulingnumber of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Recommendations

• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
• Bicriterion scheduling in the two-machine flowshop
• A heuristic approach to bicriteria scheduling
• The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• scientific article; zbMATH DE number 1149801

Cites work

• A bi-criterion single-machine scheduling problem with learning considerations
• A heuristic approach to bicriteria scheduling
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• A note on the extension of a result on scheduling with secondary criteria
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• A single-machine problem with multiple criteria
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• Complexity of single machine, multi-criteria scheduling problems
• Complexity of two dual criteria scheduling problems
• Counting and enumeration complexity with application to multicriteria scheduling
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
• Genetic local search for multi-objective flowshop scheduling problems
• Job shop scheduling with beam search
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Multicriteria scheduling
• Multiple and bicriteria scheduling: A literature survey
• One machine sequencing to minimize mean flow time with minimum number tardy
• Pareto optima for total weighted completion time and maximum lateness on a single machine
• Scheduling with Multiple Performance Measures: The One-Machine Case
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• Using genetic algorithms for single-machine bicriteria scheduling problems

Cited in

(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

This page was built for publication: New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044141)