Preemptive hybrid flowshop scheduling problem of interval orders

DOI10.1016/S0377-2217(01)00094-7MaRDI QIDQ5956203zbMATH OpenOpenAlexWikidataFDO

Authors Housni Djellab, Khaled Djellab

Publication date 20 January 2003

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

Full work available at URL https://doi.org/10.1016/s0377-2217(01)00094-7

zbMATH Keywords

flowshopinterval orderlinear programmingparallel machinespreemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1264301
• Flow shop scheduling problems under machine-dependent precedence constraints
• scientific article; zbMATH DE number 1008459
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• On the complexity of preemptive open-shop scheduling problems

Cites work

• A computational study of heuristics for two-stage flexible flowshops
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Branch and bound algorithm for the flow shop with multiple processors
• Global lower bounds for flow shops with multiple processors
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Scheduling preemptive jobs with precedence constraints on parallel machines
• Scheduling with deadlines and loss functions
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Two-Stage, Hybrid Flowshop Scheduling Problem

Cited in

(11)

• Processor-shared service systems with queue-dependent processors
• The hybrid flow shop scheduling problem
• Scheduling jobs on a \(k\)-stage flexible flow-shop
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• scientific article; zbMATH DE number 7233676 (Why is no real title available?)
• scientific article; zbMATH DE number 4199943 (Why is no real title available?)
• Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
• Preemptive Scheduling of Hybrid Parallel Machines
• A heuristic approach for scheduling advanced air mobility aircraft at vertiports
• The method of grey related analysis to multiple attribute decision making problems with interval numbers
• A taxonomy of flexible flow line scheduling procedures

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Preemptive hybrid flowshop scheduling problem of interval orders

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