A bicriteria approach to the two-machine flow shop scheduling problem
type: Item
instance of: scholarly article
title: A bicriteria approach to the two-machine flow shop scheduling problem
zbMATH Open document ID: 0957.90064
DOI: 10.1016/S0377-2217(98)00009-5
author: Serpil Sayın
author: Selçuk Karabatı
published in: European Journal of Operational Research
publication date: 2000-02-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 1368784
zbMATH Keywords: scheduling
zbMATH Keywords: multiple criteria decision making
zbMATH Keywords: efficient set
MaRDI profile type: Publication
cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
cites work: Q3970631
cites work: The two-machine total completion time flow shop problem
cites work: Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
cites work: Q3329208
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Q4279265
cites work: A single-machine problem with multiple criteria
cites work: An algorithm for the multiple objective integer linear programming problem
cites work: Multiple criteria decision support -- a review
cites work: Multiple and bicriteria scheduling: A literature survey
cites work: A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
cites work: Scheduling with Multiple Performance Measures: The One-Machine Case
cites work: Q3212909
cites work: Two-Stage Flowshop Scheduling Problem with Bicriteria
cites work: Heuristics for scheduling in flowshop with multiple objectives
cites work: On general routing problems
cites work: Q3815146
cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
cites work: Solving a bicriterion scheduling problem
full work available at URL: s0377-2217(98)00009-5
OpenAlex ID: W2061281143
description: scientific article; zbMATH DE number 1368784