On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups

DOI10.1016/j.dam.2009.02.018zbMath1185.90087OpenAlexW2030638570MaRDI QIDQ967435

J. Meng-Gérard, Francis Sourd, Philippe Chrétienne, Philippe Baptiste

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.018

zbMATH Keywords

schedulingdynamic programmingselectiontime-windowsetup

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

Cites Work

• Unnamed Item
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• Mutual exclusion scheduling with interval graphs or related classes. I
• Preemptive scheduling with rejection
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Scheduling with machine cost and rejection
• Batch processing with interval graph compatibilities between tasks
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups