Modeling and solving open shop cooperative task scheduling problems based on satisfiability modulo theories

MaRDI QIDQ4645451zbMATH OpenFDO

Authors Yosuke Kakiuchi, Kosuke Kato, Hideki Katagiri

Publication date 10 January 2019

zbMATH Keywords

schedulingsatisfiability modulo theoriesminimum makespanopen shop scheduling problemmixed 0-1 integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mixed integer programming (90C11) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• Research on task scheduling method of cooperative design
• scientific article; zbMATH DE number 1670581
• Scheduling with a constraint based cooperative solver
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Some graph‐theoretical models for scheduling in automated production systems

Cited in

(2)

• Research on task scheduling method of cooperative design
• CONFLICT IDENTIFICATION AND RECONCILIATION IN A COLLABORATIVE MANUFACTURING SCHEDULING TASK

This page was built for publication: Modeling and solving open shop cooperative task scheduling problems based on satisfiability modulo theories

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