On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
type: Item
instance of: scholarly article
title: On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
zbMATH Open document ID: 1185.90087
author: J. Meng-Gérard
author: Philippe Chrétienne
author: Philippe Baptiste
author: Francis Sourd
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5702679
zbMATH Keywords: scheduling
zbMATH Keywords: time-window
zbMATH Keywords: setup
zbMATH Keywords: selection
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.dam.2009.02.018
OpenAlex ID: W2030638570
cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
cites work: Scheduling a single machine to minimize a regular objective function under setup constraints
cites work: Multiprocessor Scheduling with Rejection
cites work: Q4475621
cites work: Techniques for scheduling with rejection
cites work: Batch processing with interval graph compatibilities between tasks
cites work: Mutual exclusion scheduling with interval graphs or related classes. I
cites work: Scheduling with machine cost and rejection
cites work: Preemptive scheduling with rejection
cites work: Preemptive multiprocessor scheduling with rejection
cites work: Minimizing the number of late jobs in a stochastic setting using a chance constraint
DOI: 10.1016/J.DAM.2009.02.018
description: scientific article; zbMATH DE number 5702679