Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

DOI10.1016/S0377-2217(00)00288-5zbMath1077.90532OpenAlexW2007828907MaRDI QIDQ5954825

No author found.

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00288-5

zbMATH Keywords

Linear programmingMulticriteria analysisSchedulinga posteriori algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Case-oriented studies in operations research (90B90)

Related Items (7)

The biobjective travelling purchaser problem ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Multicriteria scheduling problems: a survey ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ Multicriteria scheduling ⋮ Genetic local search for multi-objective flowshop scheduling problems

Uses Software

• ADBASE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Multiple and bicriteria scheduling: A literature survey
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• Proper efficiency and the theory of vector maximization
• Preemptive scheduling with staircase and piecewise linear resource availability
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

This page was built for publication: Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry