Production and transport logistics scheduling with two transport mode choices

DOI10.1002/nav.20116zbMath1278.90175MaRDI QIDQ3442918

No author found.

Publication date: 24 May 2007

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20116

zbMATH Keywords

scheduling; branch and bound algorithm; logistics; transportation modes

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

A fuzzy MCDM method and an application to solid transportation problem with mode preference, Approximation algorithms for the single-machine scheduling with a period of maintenance, An improved approximation algorithm for single machine scheduling with job delivery, Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier, Production scheduling with supply and delivery considerations to minimize the makespan, Integrated production and distribution scheduling with committed delivery dates, Synchronizing production and air transportation scheduling using mathematical programming models, Single machine scheduling with release dates and job delivery to minimize the makespan, Some Transportation Problems Under Uncertain Environments, SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item