Efficient mixed integer programming models for family scheduling problems
Meng-Ye Lin,Yarlin Kuo +1 more
7
TL;DR: In this article, the authors proposed several mixed integer programming models which incorporate optimal sequence properties into the models, to solve single machine family scheduling problems, including total weighted completion time and maximum lateness.
read more
About: This article is published in Operations Research Perspectives. The article was published on 01 Jan 2017. and is currently open access. The article focuses on the topics: Integer programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates
Thiago Henrique Nogueira,Carlos Roberto Venâncio de Carvalho,Martín Gómez Ravetti,Mauricio C. de Souza +3 more
TL;DR: In this article, six different mixed integer programming (MIP) formulations are proposed and analyzed, based on the knowledge of four different paradigms for single machine scheduling problems (SMSP) with sequence dependent setup times and release dates.
Iterated greedy algorithms for a complex parallel machine scheduling problem
TL;DR: In this paper, an Iterated Greedy (IG) algorithm combining destroy and repair operators with a Random Variable Neighborhood Descent (RVND) local search procedure was proposed to solve the problem.
18
•Posted Content
Iterated Greedy Algorithms for a Complex Parallel Machine Scheduling Problem
TL;DR: Iterated Greedy algorithms combining destroy and repair operators with a Random Variable Neighborhood Descent local search procedure are developed, using four neighborhood structures to solve the complex parallel machine scheduling problem with jobs divided into operations and operations grouped in families.
13
Single-machine scheduling with release dates, due dates and family setup times
Johannes M.J. Schutten,S.L. van de Velde,Willem H.M. Zijm +2 more
- 12 Jul 1994
TL;DR: A branch-and-bound algorithm is developed that solves almost all instances with up to about 40 jobs to optimality of the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness.
7
Iterated greedy algorithms for a complex parallel machine scheduling problem
TL;DR: In this article , the authors developed Iterated Greedy (IG) algorithms combining destroy and repair operators with a Random Variable Neighborhood Descent (RVND) local search procedure using four neighborhood structures to solve the problem.
References
Scheduling with batching: A review
TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.
1K
On the Job-Shop Scheduling Problem
TL;DR: This formulation of discrete linear programming seems, however, to involve considerably fewer variables than two other recent proposals and on these grounds may be worth some computer experimentation.
A time indexed formulation of non-preemptive single machine scheduling problems
TL;DR: In this paper, the authors consider non-preemptive single machine scheduling problems using time-indexed variables and derive a variety of valid inequalities, and show the role of constraint aggregation and the knapsack problem with generalised upper bound constraints as a way of generating such inequalities.
248
Mixed integer programming formulations for single machine scheduling problems
TL;DR: Based on the computational results, which MIP formulation might work best for various single machine scheduling problems is studied and two sets of inequalities that can be used to improve the formulation with assignment and positional date variables are presented.
143