A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
type: Item
instance of: scholarly article
title: A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
zbMATH Open document ID: 0932.68006
DOI: 10.1016/S0166-218X(99)00015-3
author: Peter Brucker
author: Thomas Hilbig
author: Johann L. Hurink
published in: Discrete Applied Mathematics
publication date: 1999-06-28T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1309383
zbMATH Keywords: metra potential method
MaRDI profile type: Publication
cites work: Q3468865
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: A branch \(\&\) bound algorithm for the open-shop problem
cites work: The job-shop problem and immediate selection
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: Job-shop scheduling with multi-purpose machines
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: Q4882527
cites work: Q4867834
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Benchmarks for basic scheduling problems
cites work: One-machine generalized precedence constrained scheduling problems
cites work: Heuristics for scheduling resource-constrained projects in MPM networks
cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
description: scientific article; zbMATH DE number 1309383