We examine simultaneous order acceptance and scheduling decisions where the orders are
defined by their release dates, due dates, deadlines, processing times, sequence …

This Paper proposes a two-step binary linear programming formulation for task scheduling
of a constellation of low-Earth-orbit satellites and demonstrates its applicability and …

We consider a make-to-order production system, where limited production capacity and
order delivery requirements necessitate selective acceptance of the orders. Since tardiness …

In this paper, we study integrated order selection and scheduling decisions, where the
manufacturer has the flexibility to choose leadtimes. Our main goal is to provide a …

This paper investigates an order acceptance and scheduling problem with an energy
consumption budget, a machine launch budget, and the order release time in a green …

This work proposes a unified heuristic algorithm for a large class of earliness–tardiness (E–
T) scheduling problems. We consider single/parallel machine E–T problems that may or may …

In this paper, we address the dynamic single-machine scheduling problem for minimisation
of total weighted tardiness by learning of dispatching rules (DRs) from schedules. We …

This paper proposes an efficient exact algorithm for the general single-machine scheduling
problem where machine idle time is permitted. The algorithm is an extension of the authors' …

This paper addresses the one-machine scheduling problem with earliness-tardiness
penalties. We propose a new branch-and-bound algorithm that can solve instances with up …

In this paper, we consider a single-machine scheduling problem (P) inspired from
manufacturing instances. A release date, a deadline, and a regular (ie, non-decreasing) cost …