Two-machine flow shop scheduling with two criteria: maximum earliness and makespan

DOI10.1016/S0377-2217(03)00192-9zbMath1103.90343OpenAlexW2091457759MaRDI QIDQ1877048

Suna Kondakcı Köksalan, Berkin Toktaş, Azizoglu, Meral

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00192-9

zbMATH Keywords

Flow shopMakespanEfficient solutionsMaximum earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Solving a bicriterion scheduling problem
• An algorithm for the multiple objective integer linear programming problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• A bicriteria two-machine permutation flowshop problem
• Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
• A bicriteria approach to the two-machine flow shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

This page was built for publication: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan