Job-shop scheduling with convex models of operations

DOI10.1016/0895-7177(94)90207-0zbMath0810.90069OpenAlexW2036387835MaRDI QIDQ1341401

V. Pereyra

Publication date: 11 January 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)90207-0

zbMATH Keywords

branch-and-boundjob-shop schedulingheuristic method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A survey of scheduling with controllable processing times ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Parallel machine scheduling with a convex resource consumption function

Cites Work

• Time-optimal control in a single machine problem with resource constraints
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• A permutation flow-shop scheduling problem with convex models of operation processing times
• Job-shop scheduling with resource-time models of operations
• An Algorithm for Solving the Job-Shop Problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Job-Shop Scheduling by Implicit Enumeration
• Unnamed Item
• Unnamed Item

This page was built for publication: Job-shop scheduling with convex models of operations