![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Reentrant two-stage multiprocessor flow shop scheduling with due windows
Reentrant flow shop scheduling allows a job to revisit a particular machine several times. The topic has received considerable interest in recent years; with related studies demonstrating that particle swarm a...
-
Article
Hybrid decision model for information project selection
Information project selection is an important and recurring activity in many organizations. Establishing a systematic project selection model thus is important for organizations. However, information system pr...
-
Article
No-wait two-stage multiprocessor flow shop scheduling with unit setup
A well-arranged production schedule enhances equipment utility rate by distributing limited resources properly, which also improves efficiency and reduces costs. No-wait operations are among the most common pr...
-
Article
Solving a multi-objective overlap** flow-shop scheduling
In flow-shop manufacturing scheduling systems, managers attempt to minimize makespan and manufacturing costs. Job overlaps are typically unavoidable in real-life applications as overlap** production shortens...
-
Article
Ant colony system for job shop scheduling with time windows
Scheduling for a job shop production system is an integral aspect of production management. Scheduling operations must minimize stock, waste, and idle time and ensure on-time delivery of goods in a time window...
-
Article
An Algorithm for Minimizing the Range of Lateness on a Single Machine
This paper considers the problem of minimizing the range of lateness on a single machine. All the algorithms in the literature for solving this problem are based on the branch-and-bound approach, which has an ...