General flow-shop scheduling with resource constraints
From MaRDI portal
Publication:3780743
DOI10.1080/00207548808947920zbMath0639.90050OpenAlexW2145420637MaRDI QIDQ3780743
Publication date: 1988
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548808947920
branch and boundallocation of resourcedisjunctive graph theorygeneral non-permutation flow-shop schedulingover-all completion time
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Flow shop scheduling with flexible processing times ⋮ A survey of scheduling with controllable processing times ⋮ A variant of the permutation flow shop model with variable processing times ⋮ Flowshop with additional resources during setups: mathematical models and a GRASP algorithm ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ Single machine scheduling problem with a common deadline and resource dependent release dates ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Scheduling two agents with controllable processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ Conjugate problems in time-dependent scheduling ⋮ Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Cites Work
This page was built for publication: General flow-shop scheduling with resource constraints
