Jackson's pseudo-preemptive schedule and cumulative scheduling problems
type: Item
instance of: scholarly article
title: Jackson's pseudo-preemptive schedule and cumulative scheduling problems
zbMATH Open document ID: 1058.90023
author: Jacques Carlier
author: Éric Pinson
published in: Discrete Applied Mathematics
publication date: 2005-01-31T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2131573
zbMATH Keywords: Scheduling
zbMATH Keywords: Resource
zbMATH Keywords: Adjustments
zbMATH Keywords: Heads
zbMATH Keywords: Makespan
zbMATH Keywords: Tails
MaRDI profile type: Publication
full work available at URL: j.dam.2003.09.009
OpenAlex ID: W2051385001
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: The one-machine sequencing problem
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: Une méthode arborescente pour résoudre les problèmes cumulatifs
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: Optimal Preemptive Scheduling on Two-Processor Systems
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Some simple scheduling algorithms
cites work: Q3217922
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: Q3959420
cites work: Nearly on line scheduling of preemptive independent tasks
DOI: 10.1016/J.DAM.2003.09.009
description: scientific article; zbMATH DE number 2131573