Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem

DOI10.1287/opre.24.4.774zbMath0335.90027OpenAlexW2145511929MaRDI QIDQ4102899

Jacques Erschler, J. P. Vernhes, François Roubellat

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.4.774

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)

Related Items (17)

A local constraint based analysis approach to project scheduling under general resource constraints ⋮ Characterizing the set of feasible sequences for n jobs to be carried out on a single machine ⋮ Job sequencing with fuzzy processing times ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics ⋮ A constraint-based perspective in resource constrained project scheduling ⋮ Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach ⋮ An improved constraint satisfaction adaptive neural network for job-shop scheduling ⋮ Local adjustments: A general algorithm ⋮ A new adaptive neural network and heuristics hybrid approach for job-shop scheduling ⋮ Production/maintenance cooperative scheduling using multi-agents and fuzzy logic ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Two-machine shop scheduling: Compromise between flexibility and makespan value ⋮ On not-first/not-last conditions in disjunctive scheduling ⋮ Computing improved optimal solutions to max-min flexible constraint satisfaction problems ⋮ Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge ⋮ Using MLP networks to design a production scheduling system

This page was built for publication: Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem