Preemptive hybrid flowshop scheduling problem of interval orders

DOI10.1016/S0377-2217(01)00094-7zbMath1002.90026WikidataQ126865199 ScholiaQ126865199MaRDI QIDQ5956203

Housni Djellab, Khaled Djellab

Publication date: 20 January 2003

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

zbMATH Keywords

linear programming; parallel machines; interval order; flowshop; preemptive scheduling

Mathematics Subject Classification ID

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

The method of grey related analysis to multiple attribute decision making problems with interval numbers, A taxonomy of flexible flow line scheduling procedures, Processor-shared service systems with queue-dependent processors, Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Global lower bounds for flow shops with multiple processors
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• 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
• Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A computational study of heuristics for two-stage flexible flowshops
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage