Mixed multigraph approach to scheduling jobs on machines of different types∗

DOI10.1080/02331939708844361MaRDI QIDQ4375439zbMATH OpenOpenAlexFDO

Authors Yuri N. Sotskov

Publication date 5 February 1998

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-boundheuristicproduction planningresource constrained project schedulingweighted mixed multigraph

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4023002
• A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
• scientific article; zbMATH DE number 41713
• Using mixed graph coloring to minimize total completion time in job shop scheduling

Cites work

• A branch and bound algorithm for the job-shop scheduling problem
• A decision support system for the resource constrained project scheduling problem
• A Review of Production Scheduling
• An Algorithm for Project (Job) Sequencing with Resource Constraints
• An Algorithm for Solving the Job-Shop Problem
• scientific article; zbMATH DE number 805284 (Why is no real title available?)
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Scheduling of project networks

Cited in

(5)

• Vyacheslav Tanaev: contributions to scheduling and related areas
• scientific article; zbMATH DE number 4023002 (Why is no real title available?)
• The supplying chain scheduling with the cost constraint and subcontracting
• A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times

This page was built for publication: Mixed multigraph approach to scheduling jobs on machines of different types^∗

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