Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
type: Item
instance of: scholarly article
title: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
zbMATH Open document ID: 1103.90343
DOI: 10.1016/S0377-2217(03)00192-9
author: Berkin Toktaş
author: Suna Kondakcı Köksalan
author: Meral Azizoğlu
published in: European Journal of Operational Research
publication date: 2004-08-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2091306
zbMATH Keywords: Flow shop
zbMATH Keywords: Makespan
zbMATH Keywords: Maximum earliness
zbMATH Keywords: Efficient solutions
MaRDI profile type: Publication
cites work: Q3970631
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: An algorithm for the multiple objective integer linear programming problem
cites work: Complexity of single machine hierarchical scheduling: A survey
cites work: A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
cites work: Genetic algorithms for the two-stage bicriteria flowshop problem
cites work: Two-Stage Flowshop Scheduling Problem with Bicriteria
cites work: A bicriteria approach to the two-machine flow shop scheduling problem
cites work: A bicriteria two-machine permutation flowshop problem
cites work: Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
cites work: Solving a bicriterion scheduling problem
cites work: Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
cites work: A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
full work available at URL: s0377-2217(03)00192-9
OpenAlex ID: W2091457759
description: scientific article; zbMATH DE number 2091306