In this paper, we investigated the scheduling issue of the vessel’s uploading data to the infostations through the maritime communication network, to optimize the dispatching process by Dynamic Programming. We mapped it as a single-machine minimized total weighted tardiness scheduling problem, subjecting to intermittent network connections in communication, packet generation and due time limita...

In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing a...

this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

This paper concerns the single machine total weighted tardiness scheduling with sequence-dependent setup times, usually referred as 1|sij | ∑ wjTj . In this NP-hard problem, each job has an associated processing time, due date and a weight. For each pair of jobs i and j, there may be a setup time before starting to process j in case this job is scheduled immediately after i. The objective is to...