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

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Ideal preemptive schedules on two processors
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
A bicriteria approach to the two-machine flow shop scheduling problem
The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
Two-machine flowshop scheduling with a secondary criterion
An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Online scheduling of ordered flow shops
Ideal schedules in parallel machine settings
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
Multicriteria scheduling
Approximation Techniques for Average Completion Time Scheduling
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
Optimal two- and three-stage production schedules with setup times included
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
Review of the ordered and proportionate flow shop scheduling research
Two-Stage Flowshop Scheduling Problem with Bicriteria
Flowshop Sequencing Problem with Ordered Processing Time Matrices
Flowshop sequencing problem with ordered processing time matrices: A general case
Flowshop and Jobshop Schedules: Complexity and Approximation
The Complexity of Flowshop and Jobshop Scheduling
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
A New Heuristic for Three-Machine Flow Shop Scheduling
Scheduling

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