Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits

DOI10.1007/S10951-023-00781-XMaRDI QIDQ6547130zbMATH OpenFDO

Authors Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo

Publication date 30 May 2024

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10951-023-00781-X

zbMATH Keywords

approximation algorithmbicriteria schedulingflowshopinapproximabilitymakespantotal completion time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• A bicriteria approach to the two-machine flow shop scheduling problem
• Bicriterion scheduling in the two-machine flowshop
• Approximation algorithms on multiple two-stage flowshops
• Improved approximation algorithms for two-stage flowshops scheduling problem

Cites work

• A bicriteria approach to the two-machine flow shop scheduling problem
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Approximation techniques for average completion time scheduling
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• scientific article; zbMATH DE number 1305482 (Why is no real title available?)
• scientific article; zbMATH DE number 1305545 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• Ideal preemptive schedules on two processors
• Ideal schedules in parallel machine settings
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Multicriteria scheduling
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Online scheduling of ordered flow shops
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
• Review of the ordered and proportionate flow shop scheduling research
• Scheduling. Theory, algorithms, and systems
• The Complexity of Flowshop and Jobshop Scheduling
• The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
• Two-machine flowshop scheduling with a secondary criterion
• Two-Stage Flowshop Scheduling Problem with Bicriteria

Cited in

(1)

• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

This page was built for publication: Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits

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