Machine scheduling with soft precedence constraints

DOI10.1016/j.ejor.2019.09.041zbMath1430.90298OpenAlexW2976166629WikidataQ127189726 ScholiaQ127189726MaRDI QIDQ2282538

Xiangtong Qi, Guanhua Li, An Zhang

Publication date: 8 January 2020

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.09.041

zbMATH Keywords

schedulingapproximation algorithmprecedence constraintsoft precedence constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

A survey of job shop scheduling problem: the types and models ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ 0-1 mathematical programming models for flexible process planning ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Scheduling of uniform parallel machines with s-precedence constraints
• On the complexity of scheduling unit-time jobs with or-precedence constraints
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Complexity results for single-machine problems with positive finish-start time-lags
• The vessel schedule recovery problem (VSRP) -- a MIP model for handling disruptions in liner shipping
• Complexity of Scheduling under Precedence Constraints
• Scheduling with AND/OR Precedence Constraints
• Scheduling Tasks with AND/OR Precedence Constraints
• Bounds on Multiprocessing Timing Anomalies
• Scheduling

This page was built for publication: Machine scheduling with soft precedence constraints