Shop scheduling problems under precedence constraints

DOI10.1023/A:1018997431986MaRDI QIDQ1357789zbMATH OpenOpenAlexFDO

Authors V. A. Strusevich

Publication date 5 February 1998

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018997431986

zbMATH Keywords

flow shopopen shopprecedence constraintsjob shoppreemptive and non-preemptive casessuper shoptime-optimal schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1008459
• Open shop scheduling with some additional constraints
• scientific article; zbMATH DE number 1264301
• Flow shop scheduling problems under machine-dependent precedence constraints
• On the complexity of preemptive open-shop scheduling problems

Cited in

(19)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
• Two-Machine Super-Shop Scheduling Problem
• Restrictions and preassignments in preemptive open shop scheduling
• An effective heuristic algorithm for the partial shop scheduling problem
• Two machine open shop scheduling problem with setup, processing and removal times separated
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• scientific article; zbMATH DE number 7145128 (Why is no real title available?)
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• Complexity of mixed shop scheduling problems: A survey
• Alternative graph formulation for solving complex factory-scheduling problems
• Vyacheslav Tanaev: contributions to scheduling and related areas
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• scientific article; zbMATH DE number 3972609 (Why is no real title available?)
• A Precedence Graph Algorithm for the Shop Scheduling Problem
• Open-shop scheduling for unit jobs under precedence constraints
• scientific article; zbMATH DE number 1054688 (Why is no real title available?)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches

This page was built for publication: Shop scheduling problems under precedence constraints

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