Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem

DOI10.1080/03155986.1979.11731736zbMATH Open0417.90046OpenAlexW2395587752MaRDI QIDQ3208405FDOQ3208405

Authors: Sankaran Lakshminarayan, Ram Lakshmanan, Robert L. Papineau, Rene Rochette 

Publication date: 1979

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1979.11731736

zbMATH Keywords

algorithmschedulingmaximum cut problemminimization of mean flow timeorder preserving allocation of jobstwo non-identical parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208405)